co-Ding Studio---科鼎工作室---博客

DescriptionGiven a string s, cut s into some substrings such that every substring is a palindrome.Return the minimum cuts needed for a palindrome partitioning of s.ExamplesExample 1:Input: “a”Ou...

DescriptionEnglishGiven a string s. Partition s such that every substring in the partition is a palindrome.Return all possible palindrome partitioning of s.ExamplesExample 1:Input: “a”Output: [...

DescriptionGiven a binary search tree and a range [k1, k2], return node values within a given range in ascending order. (https://www.lintcode.com/problem/search-range-in-binary-search-tree/descriptio...