当前标签：leetcode

116&117. Populating Next Right Pointers in Each Node I&&II (找规律)

linqiaozhou 2015-08-21 09:26 阅读:188 评论:0 推荐:0

179.Largest Number

linqiaozhou 2015-08-20 16:35 阅读:229 评论:0 推荐:0

5. Longest Palindromic Substring (最长回文字符串)

linqiaozhou 2015-07-01 17:19 阅读:267 评论:0 推荐:0

32. Longest Valid Parentheses（动态规划 Hard）

linqiaozhou 2015-07-01 14:46 阅读:447 评论:0 推荐:0

115. Distinct Subsequences （Hard）

linqiaozhou 2015-06-29 22:19 阅读:356 评论:0 推荐:0

72.Edit Distance（经典的动态规划问题）

linqiaozhou 2015-06-29 15:32 阅读:548 评论:0 推荐:0

91.Decode Ways(动态规划)

linqiaozhou 2015-06-28 16:32 阅读:568 评论:0 推荐:0

71. Simplify Path

linqiaozhou 2015-06-28 11:46 阅读:438 评论:0 推荐:0

93.Restore IP Addresses

linqiaozhou 2015-06-26 17:48 阅读:257 评论:0 推荐:0

164. Maximum Gap(Hard桶排序)

linqiaozhou 2015-06-23 17:18 阅读:824 评论:0 推荐:0

56.Merge Intervals

linqiaozhou 2015-06-19 15:54 阅读:303 评论:0 推荐:0

148. Sort Lis（链表中的归并排序）

linqiaozhou 2015-06-18 11:31 阅读:10622 评论:0 推荐:4

136&&137 .Single Number I&& II(位运算)

linqiaozhou 2015-06-16 19:57 阅读:240 评论:0 推荐:0

73. Set Matrix Zeroes

linqiaozhou 2015-06-16 16:49 阅读:437 评论:0 推荐:0

162.Find Peak Element(二分法)

linqiaozhou 2015-06-16 11:24 阅读:455 评论:0 推荐:0

48.Rotate Image

linqiaozhou 2015-06-16 09:27 阅读:410 评论:0 推荐:0

153&&154. Find Minimum in Rotated Sorted Array I&&II (II Hard)

linqiaozhou 2015-06-15 22:18 阅读:299 评论:0 推荐:0

81. Search in Rotated Sorted Array I&&II(二分法)

linqiaozhou 2015-06-15 16:46 阅读:273 评论:0 推荐:0

149. Max Points on a Line（Hard数学&&Map)

linqiaozhou 2015-06-15 14:45 阅读:290 评论:0 推荐:0

65. Valid Number(Hard 分情况讨论最经典的题）

linqiaozhou 2015-06-15 11:24 阅读:258 评论:0 推荐:0