James Pan

原题网址：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/unique-word-abbreviation/ An abbreviation of a word follows the form . Below are some examples of word abbreviations: a) it --> it (no

原题网址：https://leetcode.com/problems/remove-invalid-parentheses/ Remove the minimum number of invalid parentheses in order to make the input string valid. Return all possible results. Note: The

原题网址：https://leetcode.com/problems/combination-sum-ii/ Given a collection of candidate numbers (C) and a target number (T), find all unique combinations in C where the candidate numbers sums to

原题网址：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/unique-paths-ii/ Follow up for "Unique Paths": Now consider if some obstacles are added to the grids. How many unique paths would there be? An obstacle an