62. Unique Paths

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 动态规划 Leetcode 2019年11月08日 26次浏览

10. Regular Expression Matching

class Solution { public boolean isMatch(String s, String p) { int m = s.length(); int n = p.length(); boolean[][] dp = new Leetcode 动态规划 2019年10月30日 37次浏览

1235. Maximum Profit in Job Scheduling

We have n jobs, where every job is scheduled to be done from startTime[i] to endTime[i], obtaining a profit of profit[i]. You're given the startTime , Leetcode 动态规划 2019年10月20日 86次浏览

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-separated sequ Leetcode 动态规划 2019年10月17日 37次浏览