Spurs

  博客园 :: 首页 :: 新随笔 :: 联系 :: 订阅 :: 管理 ::

随笔分类 -  Leetcode

1 2 3 4 下一页

152. Maximum Product Subarray(中等, 神奇的 swap)
摘要：Find the contiguous subarray within an array (containing at least one number) which has the largest product. For example, given the array , the contig 阅读全文
posted @ 2017-09-16 12:38 英雄与侠义的化身 阅读(138) 评论(0) 推荐(0)

216. Combination Sum III(medium, backtrack, 本类问题做的最快的一次)
摘要：Find all possible combinations of k numbers that add up to a number n, given that only numbers from 1 to 9 can be used and each combination should be 阅读全文
posted @ 2017-09-13 11:10 英雄与侠义的化身 阅读(83) 评论(0) 推荐(0)

77. Combinations(medium, backtrack, 重要, 弄了1小时)
摘要：Given two integers n and k, return all possible combinations of k numbers out of 1 ... n. For example, If n = 4 and k = 2, a solution is: 做了好几个这种题了，就是 阅读全文
posted @ 2017-09-12 16:55 英雄与侠义的化身 阅读(122) 评论(0) 推荐(0)

47. Permutations II(medium, backtrack, 重要, 条件较难思考)
摘要：Given a collection of numbers that might contain duplicates, return all possible unique permutations. For example, have the following unique permutati 阅读全文
posted @ 2017-09-12 12:04 英雄与侠义的化身 阅读(178) 评论(0) 推荐(0)

46. Permutations(medium, backtrack, 重要)
摘要：Given a collection of distinct numbers, return all possible permutations. For example, [1,2,3] have the following permutations: 做了几个 backtrack 类的题目了, 阅读全文
posted @ 2017-09-11 16:24 英雄与侠义的化身 阅读(154) 评论(0) 推荐(0)

40. Combination Sum II(midum, backtrack, 重要)
摘要：Given a collection of candidate numbers (C) and a target number (T), find all unique combinations in C where the candidate numbers sums to T. Each num 阅读全文
posted @ 2017-09-11 11:58 英雄与侠义的化身 阅读(301) 评论(0) 推荐(0)

39. Combination Sum(medium, backtrack 的经典应用, 重要)
摘要：Given a set of candidate numbers (C) ( without duplicates ) and a target number (T), find all unique combinations in C where the candidate numbers sum 阅读全文
posted @ 2017-09-11 09:37 英雄与侠义的化身 阅读(134) 评论(0) 推荐(0)

31. Next Permutation(中等，搞清楚啥是 next permutation)
摘要：Implement next permutation, which rearranges numbers into the lexicographically next greater permutation of numbers. If such arrangement is not possib 阅读全文
posted @ 2017-09-10 12:48 英雄与侠义的化身 阅读(419) 评论(0) 推荐(0)

58. Length of Last Word(easy, 字符串问题)
摘要：Given a string s consists of upper/lower case alphabets and empty space characters , return the length of last word in the string. If the last word do 阅读全文
posted @ 2017-09-07 21:47 英雄与侠义的化身 阅读(142) 评论(0) 推荐(0)

89. Gray Code(中等，了解啥是 gray code)
摘要：知道啥是 gray code 就是收获了． 下面介绍了 gray code 发明的 motivation, 了解动机后就知道啥是 gray code 了． https://zh.wikipedia.org/wiki/格雷码 阅读全文
posted @ 2017-09-07 17:25 英雄与侠义的化身 阅读(198) 评论(0) 推荐(0)

75. Sort Colors(中等)
摘要：Given an array with n objects colored red, white or blue, sort them so that objects of the same color are adjacent, with the colors in the order red, 阅读全文
posted @ 2017-09-07 16:17 英雄与侠义的化身 阅读(124) 评论(0) 推荐(0)

90. Subsets II(中等，编写代码有难度)
摘要：Given a collection of integers that might contain duplicates, nums , return all possible subsets. Note: The solution set must not contain duplicate su 阅读全文
posted @ 2017-09-06 17:29 英雄与侠义的化身 阅读(123) 评论(0) 推荐(0)

78. Subsets(中等，集合的子集，经典问题 DFS)
摘要：Given a set of distinct integers, nums, return all possible subsets. Note: The solution set must not contain duplicate subsets. For example, If , a so 阅读全文
posted @ 2017-09-06 12:08 英雄与侠义的化身 阅读(268) 评论(0) 推荐(0)

72. Edit Distance(困难，确实挺难的，但很经典，双序列DP问题)
摘要：Given two words word1 and word2, find the minimum number of steps required to convert word1 to word2. (each operation is counted as 1 step .) You have 阅读全文
posted @ 2017-09-05 16:40 英雄与侠义的化身 阅读(129) 评论(0) 推荐(0)

64. Minimum Path Sum(中等, 又做出一个DP题, 你们非问我开不开心，当然开心喽！^^)
摘要：Given an m x n grid filled with nonnegative numbers, find a path from top left to bottom right which minimizes the sum of all numbers along its path. 阅读全文
posted @ 2017-09-02 11:59 英雄与侠义的化身 阅读(127) 评论(0) 推荐(0)

70. Climbing Stairs(easy, 号称 Dynamic Programming 天下第一题)
摘要：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 @ 2017-09-01 11:46 英雄与侠义的化身 阅读(126) 评论(0) 推荐(0)

63. Unique Paths II(中等, 能独立做出来的DP类第二个题^^)
摘要：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 empty space 阅读全文
posted @ 2017-09-01 11:15 英雄与侠义的化身 阅读(117) 评论(0) 推荐(0)

62. Unique Paths(中等，我自己解出的第一道 DP 题^^)
摘要：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 right at any p 阅读全文
posted @ 2017-08-31 17:25 英雄与侠义的化身 阅读(156) 评论(0) 推荐(0)

120. Triangle(中等)
摘要：Given a triangle, find the minimum path sum from top to bottom. Each step you may move to adjacent numbers on the row below. For example, given the fo 阅读全文
posted @ 2017-08-29 23:13 英雄与侠义的化身 阅读(162) 评论(0) 推荐(0)

128. Longest Consecutive Sequence
摘要：Given an unsorted array of integers, find the length of the longest consecutive elements sequence. For example, Given , The longest consecutive elemen 阅读全文
posted @ 2017-08-28 23:04 英雄与侠义的化身 阅读(156) 评论(0) 推荐(0)

1 2 3 4 下一页