2019年2月16日
[Lintcode]191. Maximum Product Subarray/[Leetcode]152. Maximum Product Subarray
摘要： "191. Maximum Product Subarray" / "152. Maximum Product Subarray" 本题难度: Medium Topic: Dynamic Programming Description Given an integer array nums, fin 阅读全文
posted @ 2019-02-16 22:28 siriusli 阅读(86) 评论(0) 推荐(0) 编辑
[Lintcode]41. Maximum Subarray/[Leetcode]53. Maximum Subarray
摘要： "41. Maximum Subarray" / "53. Maximum Subarray" 本题难度: Eas Topic: Dynamic Programming Description Given an array of integers, find a contiguous subarra 阅读全文
posted @ 2019-02-16 17:01 siriusli 阅读(93) 评论(0) 推荐(0) 编辑
[Lintcode]111. Climbing Stairs/[Leetcode]70. Climbing Stairs
摘要： "111. Climbing Stairs" / "70. Climbing Stairs" 本题难度: Easy Topic: Dynamic Programming Description You are climbing a stair case. It takes n steps to re 阅读全文
posted @ 2019-02-16 16:03 siriusli 阅读(92) 评论(0) 推荐(0) 编辑
[Lintcode]115. Unique Paths II/[Leetcode]63. Unique Paths II
摘要： "115. Unique Paths II" / "63. Unique Paths II" 本题难度: Easy/Medium Topic: Dynamic Programming Description Follow up for "Unique Paths": Now consider if 阅读全文
posted @ 2019-02-16 15:16 siriusli 阅读(221) 评论(0) 推荐(0) 编辑
[Leetcode]62. Unique Paths
摘要： "62. Unique Paths" 本题难度: Easy Topic: Dynamic Programming Description A robot is located at the top left corner of a m x n grid (marked 'Start' in the 阅读全文
posted @ 2019-02-16 14:56 siriusli 阅读(140) 评论(0) 推荐(0) 编辑
[Lintcode]15. Permutations/[Leetcode]46. Permutations
摘要： "15. Permutations" / "46. Permutations" 本题难度: Medium Topic: Search & Recursion Description Given a list of numbers, return all possible permutations. 阅读全文
posted @ 2019-02-16 01:55 siriusli 阅读(83) 评论(0) 推荐(0) 编辑
[Lintcode]16. Permutations II/[Leetcode]47. Permutations II
摘要： "16. Permutations II" / "47. Permutations II" 本题难度: Medium Topic: Search & Recursion Description Given a list of numbers with duplicate number in it. 阅读全文
posted @ 2019-02-16 01:46 siriusli 阅读(171) 评论(0) 推荐(0) 编辑
[Lintcode]17. Subsets/[Leetcode]78. Subsets
摘要： "17. Subsets" / "78. Subsets" 本题难度: Medium Topic: Search & Recursion Description Given a set of distinct integers, return all possible subsets. Exampl 阅读全文
posted @ 2019-02-16 00:44 siriusli 阅读(130) 评论(0) 推荐(0) 编辑
[Lintcode]18. Subsets II/[Leetcode]90. Subsets II
摘要： "18. Subsets II" / "90. Subsets II" 本题难度: Medium Topic: Search & Recursion Description Given a collection of integers that might contain duplicates, n 阅读全文
posted @ 2019-02-16 00:18 siriusli 阅读(129) 评论(0) 推荐(0) 编辑