202003-12 [LeetCode每日一题]213. House Robber II 题目如下: You are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed. All houses at this plac.... Read More >
202003-12 [LeetCode每日一题]198. House Robber 题目如下: You are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed, the only constraint sto.... Read More >
202003-11 [LeetCode每日一题]140. Word Break II 题目如下: Given a non-empty string s and a dictionary wordDict containing a list of non-empty words, add spaces in s to construct a sentence where each .... Read More >
202003-08 [LeetCode每日一题]139. Word Break 题目如下: Given a non-empty string s and a dictionary wordDict containing a list of non-empty words, determine if s can be segmented into a space-separa.... Read More >
202003-07 [LeetCode每日一题]95. Unique Binary Search Trees II 题目如下: Given an integer n, generate all structurally unique BST's (binary search trees) that store values 1 ... n. Example: Input: 3 Output: [ [1.... Read More >
202003-06 [LeetCode每日一题]96. Unique Binary Search Trees 题目如下: Given n, how many structurally unique BST's (binary search trees) that store values 1 ... n? Example: Input: 3 Output: 5 Explanation: Given .... Read More >
202003-05 [LeetCode每日一题]64. Minimum Path Sum 题目如下: Given a m x n grid filled with non-negative numbers, find a path from top left to bottom right which minimizes the sum of all numbers along it.... Read More >
202003-04 [LeetCode每日一题]63. Unique Paths II 题目如下: 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 .... Read More >
202003-03 [LeetCode每日一题]91. Decode Ways 题目如下: A message containing letters from A-Z is being encoded to numbers using the following mapping: 'A' -> 1 'B' -> 2 ... 'Z' -> 26 Given a non-emp.... Read More >
202003-02 [LeetCode每日一题]10. Regular Expression Matching 题目如下: Given an input string (s) and a pattern (p), implement regular expression matching with support for '.' and '*'. '.' Matches any single charac.... Read More >