- 博客(4)
- 收藏
- 关注
RSS订阅原创 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 increasing subsequence is [2, 3, 7, 1
2016-01-06 22:41:18
309
原创 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 climb to the top? 解题思路： 动态规划 class So
2016-01-06 21:24:41
216
原创 28. Implement strStr()
题目： Implement strStr(). Returns the index of the first occurrence of needle in haystack, or -1 if needle is not part of haystack. 解题思路： brute-force class Solution(object): def strStr(se
2016-01-06 08:50:50
246
原创 36. Valid Sudoku
题目： Determine if a Sudoku is valid, according to: Sudoku Puzzles - The Rules. The Sudoku board could be partially filled, where empty cells are filled with the character '.'. A partia
2016-01-04 20:26:29
211
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人