题目描述：
LeetCode 847. Shortest Path Visiting All Nodes
An undirected, connected graph of N nodes (labeled 0, 1, 2, ..., N-1) is given as graph.
graph.length = N, and j != i is in the list graph[i] exactly once, if and ...
档案日期2018的22
2018年5月28日 - 2018年6月3日
[LeetCode]Shortest Path Visiting All Nodes
[LeetCode]Longest Mountain in Array
作者是
发布于
在
LeetCode.
题目描述：
LeetCode 845. Longest Mountain in Array
Let's call any (contiguous) subarray B (of A) a mountain if the following properties hold:
B.length >= 3- There exists some
0 < i < B.length - 1such thatB[0] < ...
[LeetCode]Hand of Straights
作者是
发布于
在
LeetCode.
题目描述：
LeetCode 846. Hand of Straights
Alice has a hand of cards, given as an array of integers.
Now she wants to rearrange the cards into groups so that each group is size W, and consists of W consecutive cards ...
[LeetCode]Backspace String Compare
作者是
发布于
在
LeetCode.
题目描述：
LeetCode 844. Backspace String Compare
Given two strings S and T, return if they are equal when both are typed into empty text editors. # means a backspace character.
Example 1:
Input: S = "ab#c", T = "ad#c" Output: true Explanation ...