摘要：
338. 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 r 阅读全文
posted @ 2016-04-06 22:57
水月心刀
阅读(178)
评论(0)
推荐(0)
摘要：
258. Add Digits Given a non-negative integer num, repeatedly add all its digits until the result has only one digit. For example: Given num = 38, the 阅读全文
posted @ 2016-04-06 22:55
水月心刀
阅读(108)
评论(0)
推荐(0)
摘要：
136. Single Number Given an array of integers, every element appears twice except for one. Find that single one. Note: Your algorithm should have a li 阅读全文
posted @ 2016-04-06 22:54
水月心刀
阅读(122)
评论(0)
推荐(0)
摘要：
1. Two Sum Given an array of integers, return indices of the two numbers such that they add up to a specific target. You may assume that each input wo 阅读全文
posted @ 2016-04-06 19:06
水月心刀
阅读(101)
评论(0)
推荐(0)
浙公网安备 33010602011771号