2016年8月2日
leetcode 70. Climbing Stairs
摘要： You are climbing a stair case. It takes n steps to reach to the top. Each time you can either climb 1 or 2 steps. In how many distinct ways can you cl 阅读全文
posted @ 2016-08-02 12:44 冰凌花花～ 阅读(123) 评论(0) 推荐(0)
leetcode 300. Longest Increasing Subsequence
摘要： Given an unsorted array of integers, find the length of longest increasing subsequence. For example,Given [10, 9, 2, 5, 3, 7, 101, 18],The longest inc 阅读全文
posted @ 2016-08-02 12:39 冰凌花花～ 阅读(579) 评论(0) 推荐(0)
leetcode 53. Maximum Subarray
摘要： Find the contiguous subarray within an array (containing at least one number) which has the largest sum. For example, given the array [−2,1,−3,4,−1,2, 阅读全文
posted @ 2016-08-02 11:28 冰凌花花～ 阅读(121) 评论(0) 推荐(0)