James Pan

原题网址：https://leetcode.com/problems/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

原题网址：https://leetcode.com/problems/generate-parentheses/Given n pairs of parentheses, write a function to generate all combinations of well-formed parentheses.For example, given n = 3, a sol

原题网址：https://leetcode.com/problems/permutation-sequence/The set [1,2,3,…,n] contains a total of n! unique permutations.By listing and labeling all of the permutations in order,We get the

原题网址：https://leetcode.com/problems/permutations-ii/Given a collection of numbers that might contain duplicates, return all possible unique permutations.For example,[1,1,2] have the followi

原题网址：https://leetcode.com/problems/permutations/Given a collection of distinct numbers, return all possible permutations.For example,[1,2,3] have the following permutations:[1,2,3], [1,3

原题网址：https://leetcode.com/problems/next-permutation/Implement next permutation, which rearranges numbers into the lexicographically next greater permutation of numbers.If such arrangement is

原题网址：https://leetcode.com/problems/create-maximum-number/Given two arrays of length m and n with digits 0-9 representing two numbers. Create the maximum number of length k  from digits of th

原题网址：https://leetcode.com/problems/binary-tree-vertical-order-traversal/Given a binary tree, return the vertical order traversal of its nodes' values. (ie, from top to bottom, column by column).

原题网址：https://leetcode.com/problems/largest-number/Given a list of non negative integers, arrange them such that they form the largest number.For example, given [3, 30, 34, 5, 9], the largest

原题网址：https://leetcode.com/problems/palindrome-permutation-ii/Given a string s, return all the palindromic permutations (without duplicates) of it. Return an empty list if no palindromic permut

原题网址：https://leetcode.com/problems/count-numbers-with-unique-digits/Given a non-negative integer n, count all numbers with unique digits, x, where 0 ≤ x n.Example:Given n = 2, return 91. (