Clone Graph
Given a reference of a node in a connected undirected graph, return a deep copy (clone) of the graph. Each node in the graph contains a val (int) and a list (List[Node]) of its neighbors.
（深度拷贝图）
LeetCode_Palindrome Partitioning II
Posted on
|
In
LeetCode
Palindrome Partitioning II
Given a string s, partition s such that every substring of the partition is a palindrome. Return the minimum cuts needed for a palindrome partitioning of s.
（最少切分字符串，每个子串都是回文序列）
LeetCode_Palindrome Partitioning
Posted on
|
In
LeetCode
Palindrome Partitioning
Given a string s, partition s such that every substring of the partition is a palindrome. Return all possible palindrome partitioning of s.
（切分字符串，每个子串都是回文序列）
LeetCode_Surrounded Regions
Posted on
|
Edited on
|
In
LeetCode
Surrounded Regions
Given a 2D board containing ‘X’ and ‘O’ (the letter O), capture all regions surrounded by ‘X’. A region is captured by flipping all ‘O’s into ‘X’s in that surrounded region.
（包围区域）
LeetCode_Sum Root to Leaf Numbers
Posted on
|
In
LeetCode
Sum Root to Leaf Numbers
Given a binary tree containing digits from 0-9 only, each root-to-leaf path could represent a number. An example is the root-to-leaf path 1->2->3 which represents the number 123. Find the total sum of all root-to-leaf numbers.
（树型数值之和）
LeetCode_Longest Consecutive Sequence
Posted on
|
In
LeetCode
Longest Consecutive Sequence
Given an unsorted array of integers, find the length of the longest consecutive elements sequence. Your algorithm should run in O(n) complexity.
（时间复杂度为O(n)，乱序数组中找到最长连续的数列）
LeetCode_Word Ladder II
Posted on
|
Edited on
|
In
LeetCode
Word Ladder II
Given two words (beginWord and endWord), and a dictionary’s word list, find the length of shortest transformation sequence from beginWord to endWord.
（词语阶梯）
LeetCode_Word Ladder
Posted on
|
In
LeetCode
Word Ladder
Given two words (beginWord and endWord), and a dictionary’s word list, find the length of shortest transformation sequence from beginWord to endWord.
（词语阶梯）
LeetCode_Valid Palindrome
Posted on
|
In
LeetCode
Valid Palindrome
Given a string, determine if it is a palindrome, considering only alphanumeric characters and ignoring cases.
（回文字符串）
LeetCode_Binary Tree Maximum Path Sum
Posted on
|
In
LeetCode
Binary Tree Maximum Path Sum
Given a non-empty binary tree, find the maximum path sum. For this problem, a path is defined as any sequence of nodes from some starting node to any node in the tree along the parent-child connections. The path must contain at least one node and does not need to go through the root.
（二叉树最大路径和）