IP属地:新泽西州
Palindrome Permutation II (Medium) Given a string s, return all the pali...
这道题的难点在于,如何用O(1)的空间inorder traverse tree,利用到了Morris Algorithm,关键点要理解一个概念...
题目描述: Given an array of stringsarr. Stringsis a concatenation of a sub-s...
题目描述: you have some sticks withpositive integer lengths. You can connect...
暴力解O(n^2),因此最优解应该是Onlogn,或者On,但是大概率猜测是nlogn。 class Solution { public L...