- 博客(3)
- 收藏
- 关注
RSS订阅原创 542. 01 Matrix
void setZero(int x, int y , int[][] matrix , int[][] ans){ Queue<int[]> que = new LinkedList<>(); int high = matrix.length; int len = matrix[0].length; int[][] move = { ...
2019-11-02 17:36:09
78
原创 5. Longest Palindromic Substring
Leetcode 5. Longest Palindromic Substring题目：解法一：DP 题目： Given a string s, find the longest palindromic substring in s. You may assume that the maximum length of s is 1000. Example 1: Input: "babad" Ou...
2019-10-29 10:24:28
50
原创 Leetcode 792. Number of Matching Subsequences
Leetcode 792. Number of Matching Subsequences题目：解法一： 题目： Given string S and a dictionary of words words, find the number of words[i] that is a subsequence of S. Example : Input: S = "abcde" words = ["...
2019-10-28 16:59:52
172
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人