![](https://img-blog.csdnimg.cn/20201014180756927.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
LeetCode
文章平均质量分 68
Koooooye
这个作者很懒,什么都没留下…
展开
-
【LeetCode-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 representation and return them as an array. Example: For原创 2016-03-30 22:09:19 · 247 阅读 · 0 评论 -
【LeetCode-330】Patching Array
原题: Given a sorted positive integer array nums and an integer n, add/patch elements to the array such that any number in range [1, n] inclusive can be formed by the sum of some elements in the原创 2016-03-30 22:46:04 · 1028 阅读 · 2 评论 -
【LeetCode-322】Coin Change
原题: You are given coins of different denominations and a total amount of money amount. Write a function to compute the fewest number of coins that you need to make up that amount. If that amount原创 2016-04-01 17:50:58 · 221 阅读 · 0 评论