- 博客(4)
- 资源 (7)
- 收藏
- 关注
RSS订阅原创 Path Sum
Given a binary tree and a sum, determine if the tree has a root-to-leaf path such that adding up all the values along the path equals the given sum. For example: Given the below binary tree and sum
2016-12-31 14:56:51
356
原创 Bulls and Cows
You are playing the following Bulls and Cows game with your friend: You write down a number and ask your friend to guess what the number is. Each time your friend makes a guess, you provide a hint t
2016-12-31 14:18:35
434
原创 Count and Say
LeetCode The count-and-say sequence is the sequence of integers beginning as follows: 1, 11, 21, 1211, 111221, ... 1 is read off as "one 1" or 11. 11 is read off as "two 1s" or 21. 21 is
2016-12-30 16:13:26
389
原创 Divide Two Integers
题目 ： Divide two integers without using multiplication, division and mod operator. If it is overflow, return MAX_INT. 我们不实用除法进行整数除法运算，如果溢出的话，我们就返回整形的最大值。 1、我们第一想到的是直接相减（a, b),被除数不断的减去除数看最多能减几次
2016-12-26 22:12:56
477
struts 2.1.6-all.zip
2015-06-10
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人