- 博客(3)
- 资源 (3)
- 收藏
- 关注
RSS订阅原创 [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 array. Re
2016-03-20 09:36:44
1374
原创 [LeetCode 332] Reconstruct Itinerary
Given a list of airline tickets represented by pairs of departure and arrival airports [from, to], reconstruct the itinerary in order. All of the tickets belong to a man who departs from JFK. Thus
2016-03-20 09:25:38
2759
原创 [LeetCode 335] Self Crossing
You are given an array x of n positive numbers. You start at point (0,0) and moves x[0] metres to the north, then x[1] metres to the west, x[2] metres to the south, x[3]metres to the east and so
2016-03-20 09:22:14
1341
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人