- 博客(2)
- 资源 (1)
- 收藏
- 关注
RSS订阅原创 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 num = 5
2017-01-04 16:24:28
365
原创 LeetCode 419. Battleships in a Board
Given an 2D board, count how many different battleships are in it. The battleships are represented with 'X's, empty slots are represented with '.'s. You may assume the following rules:You receiv
2017-01-03 17:19:48
402
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人