题目链接：https://leetcode.com/problems/counting-bits/
题目：
Given a non negative integer number num. For every numbers i in the range 0 ≤ i ≤ num calculate the number of 1's in their binary representa...
分类：
其他好文 时间：
2016-05-30 15:35:05
阅读次数：
174
Count Primes
Total Accepted: 65068 Total
Submissions: 263838 Difficulty: Easy
Description:
Count the number of prime numbers less than a non-negative number, n.
Credits:
S...
分类：
其他好文 时间：
2016-05-30 15:24:24
阅读次数：
187
Given n non-negative integers representing an elevation map where the width of each bar is 1, compute how much water it is able to trap after raining. ...
分类：
移动开发 时间：
2016-05-29 22:59:45
阅读次数：
203
Given n non-negative integers a1, a2, ..., an, where each represents a point at coordinate (i, ai). n vertical lines are drawn such that the two endpo ...
分类：
其他好文 时间：
2016-05-29 13:35:18
阅读次数：
172
Given a m x n grid filled with non-negative numbers, find a path from top left to bottom right which minimizes the sum of all numbers along its path. ...
分类：
其他好文 时间：
2016-05-28 12:54:56
阅读次数：
163
题目链接：https://leetcode.com/problems/basic-calculator-ii/题目：
Implement a basic calculator to evaluate a simple expression string.The expression string contains only non-negative integers, +, -, *, / op...
分类：
其他好文 时间：
2016-05-27 12:55:37
阅读次数：
137
题目链接：https://leetcode.com/problems/jump-game/题目：
Given an array of non-negative integers, you are initially positioned at the first index of the array.Each element in the array represents your maximu...
分类：
其他好文 时间：
2016-05-27 12:54:52
阅读次数：
138
一天一道LeetCode系列（一）题目
Given a list, rotate the list to the right by k places, where k is non-negative.
For example:
Given 1->2->3->4->5->NULL and k = 2,
return 4->5->1->2->3->NULL.
（二）解题本题的思...
分类：
其他好文 时间：
2016-05-27 12:16:48
阅读次数：
142
题目链接：https://leetcode.com/problems/container-with-most-water/
题目：
Given n non-negative integers a1, a2,
..., an, where each represents a point at coordinate (i, ai). n vertical
lines are dra...
分类：
其他好文 时间：
2016-05-27 11:53:57
阅读次数：
172
Given n non-negative integers representing an elevation map where the width of each bar is 1, compute how much water it is able to trap after raining.
For example,
Given [0,1,0,2,1,0,1,3,2,1,2,1]...
分类：
移动开发 时间：
2016-05-27 11:27:02
阅读次数：
128
