題目: Given a string s1, we may represent it as a binary tree by partitioning it to two non-empty substrings recursively. Below is one possible ...
Given a strings , we may represent it as a binary tree by partitioning it to two non empty substrings recursively. Below is one possible representation ofs great : To scramble the string, we may choos ...
2014-04-28 13:20 1 3946 推薦指數:
題目: Given a string s1, we may represent it as a binary tree by partitioning it to two non-empty substrings recursively. Below is one possible ...
Scramble String Given a string s1, we may represent it as a binary tree by partitioning it to two non-empty substrings recursively. Below is one ...
representation of s1 = "great": To scramble the string, ...
題目: Given s1, s2, s3, find whether s3 is formed by the interleaving of s1 and s2. For example, ...
題目原文: implement atoi to convert a string to an integer. Hint:Carefully consider all possible input cases.if you want a challenge,please do ...
Given s1, s2, s3, find whether s3 is formed by the interleaving of s1 and s2. For example,Given:s1 ...
Reverse Words in a String 題目鏈接:http://oj.leetcode.com/problems/reverse-words-in-a-string/ Given an input string, reverse the string word ...
這道題要求in-place做法,不能使用extra space, 那么,做法跟Rotate Array那道題非常相似 (1)reverse the whole array (2)re ...