- 博客(5)
- 收藏
- 关注
RSS订阅原创 63. Unique Paths II
63. Unique Paths IIFollow up for “Unique Paths”:Now consider if some obstacles are added to the grids. How many unique paths would there be?An obstacle and empty space is marked as 1 and 0 respectively
2018-01-10 19:47:55
184
原创 62. Unique Paths
62. Unique PathsA robot is located at the top-left corner of a m x n grid (marked ‘Start’ in the diagram below).The robot can only move either down or right at any point in time. The robot is tr
2018-01-10 19:18:45
159
原创 《算法概论》Ex8.14
《算法概论》Ex8.14 Prove that the following problem is NP-complete: given an undirected graph G=(V,E)G = (V,E) and an integer kk, return a clique of size kk as well as an independent set of size kk, provid
2018-01-03 15:29:45
317
原创 55. Jump Game
55. Jump GameGiven an array of non-negative integers, you are initially positioned at the first index of the array.Each element in the array represents your maximum jump length at that position.Determi
2018-01-03 14:36:42
199
原创 679. 24 Game
679. 24 GameYou have 4 cards each containing a number from 1 to 9. You need to judge whether they could operated through *, /, +, -, (, ) to get the value of 24.Example 1: Input: [4, 1, 8, 7] Outp
2018-01-03 01:15:11
249
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人