摘要:
题目Total Accepted: 47928 Total Submissions: 148011 Difficulty: Medium Given a m x n grid filled with non-negative numbers, find a path from to...
阅读全文
posted @ 2015-09-11 21:44
Coding菌
阅读(102)
推荐(0)
摘要:
题目Follow up for “Unique Paths”:Now consider if some obstacles are added to the grids. How many unique paths would there be?An obstacle and em...
阅读全文
posted @ 2015-09-11 21:24
Coding菌
阅读(143)
推荐(0)
摘要:
题目A robot is located at the top-left corner of a m x n grid (marked ‘Start’ in the diagram below).The robot can only move either down or righ...
阅读全文
posted @ 2015-09-11 21:01
Coding菌
阅读(132)
推荐(0)
摘要:
题目蒙特卡罗算法的典型应用之一为求圆周率PI问题。思想:一个半径r=1的圆,其面积为:S=PI∗r2=PI/4一个边长r=1的正方形,其面积为:S=r2=1那么建立一个坐标系,如果均匀的向正方形内撒点,那么落入圆心在正方形中心,半径为1的圆内的点数与全部点数的比例应该为PI/4,根...
阅读全文
posted @ 2015-09-11 20:27
Coding菌
阅读(871)
推荐(0)
摘要:
序最近学习Unix网络编程,在第10章节,SCTP客户/服务器 程序实现时,发现很多由于系统没有安装sctp协议,引发的bug;因此,现将在CentOS上的sctp安装记录如下:安装如图(1)使用命令yum list lksctp* 查看需要安装列表(2)使用yum install...
阅读全文
posted @ 2015-09-11 17:06
Coding菌
阅读(776)
推荐(0)