-
LeetCode(131)Palindrome Partitioning
摘要:题目 Given a string s, partition s such that every substring of the partition is a palindrome. Return all possible palindrome partitioning of s. For exa
阅读全文
-
LeetCode(124) Binary Tree Maximum Path Sum
摘要:题目 Given a binary tree, find the maximum path sum. For this problem, a path is defined as any sequence of nodes from some starting node to any node in
阅读全文
-
LeetCode(115) Distinct Subsequences
摘要:题目 Given a string S and a string T, count the number of distinct subsequences of T in S. A subsequence of a string is a new string which is formed fro
阅读全文
-
LeetCode(97) Interleaving String
摘要:题目 Given s1, s2, s3, find whether s3 is formed by the interleaving of s1 and s2. For example, Given: s1 = "aabcc", s2 = "dbbca", When s3 = "aadbbcbcac
阅读全文
-
LeetCode(93) Restore IP Addresses
摘要:题目 Given a string containing only digits, restore it by returning all possible valid IP address combinations. For example: Given “25525511135”, return
阅读全文
-
LeetCode(84) Largest Rectangle in Histogram
摘要:题目 Given n non-negative integers representing the histogram’s bar height where the width of each bar is 1, find the area of largest rectangle in the h
阅读全文
|