Maximum Subarray
Given an integer array nums, find the contiguous subarray (containing at least one number) which has the largest sum and return its sum.
(数组连续子串的和最大)
LeetCode_N-Queens II
N-Queens II
The n-queens puzzle is the problem of placing n queens on an n×n chessboard such that no two queens attack each other.
(N皇后的问题，求解个数)
LeetCode_N-Queens
N-Queens
The n-queens puzzle is the problem of placing n queens on an n×n chessboard such that no two queens attack each other.
(N皇后的问题，求所有解)
LeetCode_Pow(x, n)
Pow(x, n)
Implement pow(x, n), which calculates x raised to the power n (x^n).
(指数计算)
LeetCode_Group Anagrams
Group Anagrams
Given an array of strings, group anagrams together.
(将使用相同字符构成的不同排列的单词合并)
LeetCode_Rotate Image
Rotate Image
You are given an nxn 2D matrix representing an image. Rotate the image by 90 degrees (clockwise).
(顺时针旋转矩阵90度)
LeetCode_Permutations II
Permutations II
Given a collection of numbers that might contain duplicates, return all possible unique permutations.
(含有重复元素的全排列)
LeetCode_Permutations
Permutations
Given a collection of distinct integers, return all possible permutations.
(排列组合)
LeetCode_Jump Game II
Jump Game II
Given an array of non-negative integers, you are initially positioned at the first index of the array. Each element in the array represents your maximum jump length at that position. Your goal is to reach the last index in the minimum number of jumps.
(跳棋游戏II，最小步到队尾)
LeetCode_Wildcard Matching
Wildcard Matching
Given an input string (s) and a pattern (p), implement wildcard pattern matching with support for “?” and “*”.
(通配符匹配)