码迷,mamicode.com
首页 >  
搜索关键字:would you like some more rice    ( 45620个结果
Some May Pick The Perfect Color And Style The Bag May Have
One of the factors that make these bags so well known that it is true that they are very stylish, these bags come in different designs. A wide range o...
分类:其他好文   时间:2014-06-29 13:50:06    阅读次数:302
LeetCode: Distinct Subsequences [115]
【题目】 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 from the original string by deleting some (can be none) of the characters without disturbing the relati...
分类:其他好文   时间:2014-06-29 07:27:17    阅读次数:210
Construct Binary Tree from Preorder and Inorder Traversal
题目 Given preorder and inorder traversal of a tree, construct the binary tree. Note: You may assume that duplicates do not exist in the tree. 方法 根据树的中序遍历和前序遍历,来构造树,使用递归的思想。 Tre...
分类:其他好文   时间:2014-06-20 12:14:49    阅读次数:262
循环-20. 猜数字游戏(15)
猜数字游戏是令系统随机产生一个100以内的正整数,用户输入一个数对其进行猜测,需要你编写程序自动对其与随机产生的被猜数进行比较,并提示大了(“Too big”),还是小了(“Too small”),相等表示猜到了。如果猜到,则结束程序。程序还要求统计猜的次数,如果1次猜出该数,提示“Bingo!”;如果3次以内猜到该数,则提示“Lucky You!”;如果超过3次但是在N(>3)次以内(包括第N次...
分类:其他好文   时间:2014-06-20 10:38:48    阅读次数:196
Construct Binary Tree from Inorder and Postorder Traversal
题目 Given inorder and postorder traversal of a tree, construct the binary tree. Note: You may assume that duplicates do not exist in the tree. 方法 根据树的中序遍历和后序遍历,来恢复树,使用递归的思想。 Tr...
分类:其他好文   时间:2014-06-07 14:50:37    阅读次数:231
LeetCode: Flatten Binary Tree to Linked List [114]
【题目】 Given a binary tree, flatten it to a linked list in-place. For example, Given 1 / 2 5 / \ 3 4 6 The flattened tree should look like: 1 2 3 4 \...
分类:其他好文   时间:2014-06-07 11:37:00    阅读次数:153
【Vegas原创】Livewriter不能连接博客园的解决办法
报错现象:解决方法:1,日志网址上面,随便输入一个字符,比如:a ,下一步2,手动配置日志类型:a) 在“Type of weblog that you are using”中选择“Custom(Metaweblog API)”。 b) “Remote posting URL for your we...
分类:其他好文   时间:2014-06-07 08:52:05    阅读次数:254
通过Ibinder类Bind service
Binder is like RPC in java. It enables multi-processes communication. Now we will talking about how to bind service using IBinder class.总共有3种bind serv...
分类:其他好文   时间:2014-06-07 06:29:37    阅读次数:232
【LeetCode】Partition List
Partition ListGiven a linked list and a valuex, partition it such that all nodes less thanxcome before nodes greater than or equal tox.You should pres...
分类:其他好文   时间:2014-06-07 06:24:57    阅读次数:179
leetcode--Populating Next Right Pointers in Each Node II
Follow up for problem "Populating Next Right Pointers in Each Node".What if the given tree could be any binary tree? Would your previous solution stil...
分类:其他好文   时间:2014-06-05 13:26:37    阅读次数:335
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!