趁着年轻抓紧逆袭呀！

一、Pow(x,n)描述：Implement pow(x, n).二、Sqrt(x)描述：Implement int sqrt(int x).Compute and return the square root of x.三、permutations：题目描述Given a collection of numbers, return all possible permutations.四、permutations-ii：题目描述Given a collection of numbers that mi

八、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", return true.W

一、Maximum Subarray（最大连续子序列和）二、Candy三、triangle四、climbing-stairs五、minimum-path-sum六、unique-paths七、unique-paths-ii

一、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 example, given s ="aa

题目描述Given a string s consists of upper/lower-case alphabets and empty space characters' ', return the length of last word in the string.If the last word does not exist, return 0.Note: A word i

LeetCode练习-字符串-longest-substring-without-repeating-characters

题目描述Determine whether an integer is a palindrome. Do this without extra space.click to show spoilers.Some hints:Could negative integers be palindromes? (ie, -1)If you are thinking of conve

题目描述Given a string s and a dictionary of words dict, determine ifs can be segmented into a space-separated sequence of one or more dictionary words.For example, givens ="leetcode",dict =