leetcode
山楂W
这个作者很懒,什么都没留下…
展开
-
Count and Say(tag:String)
Qustion: The count-and-say sequence is the sequence of integers with the first five terms as following: 1. 1 2. 11 3. 21 4. 1211 5. 111221 1 is read off as "one 1" or 11.原创 2017-07-05 19:20:38 · 267 阅读 · 1 评论 -
Reverse String I、II、III(tag:String)
Reverse String I: Write a function that takes a string as input and returns the string reversed. Example: Given s = "hello", return "olleh". Solution1(最开始自己的思路,效率较低): public static Stri原创 2017-07-06 20:33:58 · 212 阅读 · 1 评论 -
Construct String from Binary Tree(tag:String)
You need to construct a string consists of parenthesis and integers from a binary tree with the preorder traversing way. The null node needs to be represented by empty parenthesis pair "()". And yo原创 2017-07-08 21:09:00 · 190 阅读 · 2 评论