2014年10月18日
[LeetCode] 153. Find Minimum in Rotated Sorted Array 寻找旋转有序数组的最小值
摘要： Suppose an array of length n sorted in ascending order is rotated between 1 and n times. For example, the array nums = [0,1,2,4,5,6,7] might become: [ 阅读全文
posted @ 2014-10-18 13:05 Grandyang 阅读(17173) 评论(14) 推荐(1)
[LeetCode] Pascal's Triangle 杨辉三角
摘要： Given a non-negative integer numRows, generate the first numRows of Pascal's triangle. In Pascal's triangle, each number is the sum of the two numbers 阅读全文
posted @ 2014-10-18 04:17 Grandyang 阅读(9989) 评论(2) 推荐(2)
Fork me on GitHub