Palindrome Permutation II (Medium) Given a string s, return all the palindromic permuta...
发简信
IP属地：新泽西州
-
Leetcode 267 Palindrome Permutaion II
-
LeetCode 99. Recover Binary Search Tree
这道题的难点在于，如何用O(1)的空间inorder traverse tree，利用到了Morris Algorithm,关键点要理解一个概念，前驱点，也就是一个点，他的左...
-
Leetcode 1239. Maximum Length of a Concatenated String with Unique Characters
题目描述： Given an array of stringsarr. Stringsis a concatenation of a sub-sequence ofarrwh...
-
Leetcode 1167 Minimum Cost to Connect Sticks
题目描述： you have some sticks withpositive integer lengths. You can connect any two sticks...
-
LeetCode 315 Count of Smaller Numbers After Self (hard)
暴力解O(n^2)，因此最优解应该是Onlogn，或者On，但是大概率猜测是nlogn。 class Solution { public List countSmall...