- 博客(6)
- 收藏
- 关注
RSS订阅原创 LeetCodeOJ_189_Rotate Array
Rotate an array of n elements to the right by k steps.For example, with n = 7 and k = 3, the array [1,2,3,4,5,6,7] is rotated to [5,6,7,1,2,3,4]. Note:Try to come up as many solutions as you can, there are at least 3 different ways to solve this proble
2015-06-17 16:22:56
382
原创 LeetCodeOJ_191_Number of 1 Bits_e
For example, the 32-bit integer ’11' has binary representation 00000000000000000000000000001011, so the function should return 3.
2015-06-12 11:09:25
352
原创 LeetCodeOJ_198_House Robber_e
You are a professionalrobber planning to rob houses along a street. Each house has a certain amountof money stashed, the only constraint stopping you from robbing each of them isthat adjacent houses have security system connected and it will automaticallyc
2015-06-12 11:06:39
307
原创 LeetCodeOJ_199_Binary Tree Right Side View
Given a binary tree, imagine yourself standing on the right side of it, return the values of the nodes you can see ordered from top to bottom.
2015-06-12 10:55:01
439
原创 LeetCodeOJ_200_Number of Islands
Given a 2d grid map of '1's (land) and '0's (water), count the number of islands. An island is surrounded by water and is formed by connecting adjacent lands horizontally or vertically. You may assume all four edges of the grid are all surrounded by water.
2015-06-08 23:46:43
337
原创 LeetCodeOJ_201_Bitwise AND of Numbers Range
Given a range [m, n]where 0 <= m <= n <= 2147483647, return the bitwise AND of all numbersin this range, inclusive.For example, giventhe range [5, 7], you should return 4.
2015-06-07 15:48:30
365
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人