- 博客(6)
- 收藏
- 关注
原创 LeetCode 417. Pacific Atlantic Water Flow
Given anm x nmatrix of non-negative integers representing the height of each unit cell in a continent, the "Pacific ocean" touches the left and top edges of the matrix and the "Atlantic ocean" touch...
2019-09-28 22:13:55 153
原创 LeetCode 241. Different Ways to Add Parentheses
Given a string of numbers and operators, return all possible results from computing all the different possible ways to group numbers and operators. The valid operators are+,-and*.Example 1:In...
2019-09-24 19:18:00 138
原创 计算在网格中从原点到特定点的最短路径长度
[[1,1,0,1], [1,0,1,0], [1,1,1,1], [1,0,1,1]]题目描述:1 表示可以经过某个位置,求解从 (0, 0) 位置到 (tr, tc) 位置的最短路径长度。采用bfs方法:import java.util.*;public class ShortestPath { public static void main(St...
2019-09-18 20:13:53 782
原创 LeetCode 665. Non-decreasing Array
Given an array withnintegers, your task is to check if it could become non-decreasing by modifyingat most1element.We define an array is non-decreasing ifarray[i] <= array[i + 1]holds for e...
2019-09-10 21:52:05 101
原创 LeetCode 763.Partition Labels
A stringSof lowercase letters is given. We want to partition this string into as many parts as possible so that each letter appears in at most one part, and return a list of integers representing th...
2019-09-10 21:41:14 128
原创 LeetCode547. Friend Circles
There areNstudents in a class. Some of them are friends, while some are not. Their friendship is transitive in nature. For example, if A is adirectfriend of B, and B is adirectfriend of C, then ...
2019-09-10 20:43:36 123
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人