# 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 =...# Linked List Cycle I, II; Find the Duplicate Number

这几道题目都比较类似，都是用快慢指针法(fast, slow pointers)，所以放在一起说好了。**Linked List Cycle**Given a linked list, determine if it has a cycl...

# 73. Set Matrix Zeroes

Given a*m*x

*n*matrix, if an element is 0, set its entire row and column to 0. Do it in place. 由于要求"do it in place"，所以也就是说要求我们只能用O(1)的空间复杂...

# 93. Restore IP Addresses

Given a string containing only digits, restore it by returning all possible valid IP address combinations. For example: Given "25525511135", return ["255.255.11.135", "255.255.111.35"]. (Order ...# 57. Insert Interval

Given a set of non-overlapping intervals, insert a new interval into the intervals (merge if necessary). You may assume that the intervals were initially sorted according to their start times. E...# 56. Merge Intervals

Given a collection of intervals, merge all overlapping intervals. For example, Given [1,3],[2,6],[8,10],[15,18], return [1,6],[8,10],[15,18]. 该题目用Greedy，先对start的时间进行从...# 174. Dungeon Game

The demons had captured the princess (**P**) and imprisoned her in the bottom-right corner of a dungeon. The dungeon consists of M x N rooms laid out in a 2D grid. Our valiant knight (

**K**) was...

# 64. Minimum Path Sum

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.

**Note:**You can only ...

# 152. Maximum Product Subarray

Find the contiguous subarray within an array (containing at least one number) which has the largest product. For example, given the array [2,3,-2,4], the contiguous subarray [2,3] has the largest ...- 2 of 3
- « Previous
- 1
- 2
- 3
- Next »