题目描述：
LeetCode 785. Is Graph Bipartite?
Given a graph, return true if and only if it is bipartite.
Recall that a graph is bipartite if we can split it's set of nodes into two independent subsets A and B such that ...
标签归档：leetcode
[LeetCode]Is Graph Bipartite?
[LeetCode]Letter Case Permutation
作者是
发布于
在
LeetCode.
题目描述：
LeetCode 784. Letter Case Permutation
Given a string S, we can transform every letter individually to be lowercase or uppercase to create another string. Return a list of all possible strings we could create.
Examples: Input: S = "a1b2" Output ...
[LeetCode]Reaching Points
作者是
发布于
在
LeetCode.
题目描述：
A move consists of taking a point (x, y) and transforming it to either (x, x+y) or (x+y, y).
Given a starting point (sx, sy) and a target point (tx, ty), return True ...
[LeetCode]Rabbits in Forest
作者是
发布于
在
LeetCode.
题目描述：
LeetCode 781. Rabbits in Forest
In a forest, each rabbit has some color. Some subset of rabbits (possibly all of them) tell you how many other rabbits have the same color as them. Those answers are placed in an ...
[LeetCode]Minimum Distance Between BST Nodes
作者是
发布于
在
LeetCode.
题目描述：
LeetCode 783. Minimum Distance Between BST Nodes
Given a Binary Search Tree (BST) with the root node root, return the minimum difference between the values of any two different nodes in the tree.
Example :
Input: root = [4,2,6,1 ...