- 博客(2)
- 收藏
- 关注
RSS订阅原创 lintcode:Partition Array
Given an array nums of integers and an int k, partition the array (i.e move the elements in "nums") such that: All elements k are moved to the leftAll elements >= k are moved to the right Retu
2015-06-25 21:23:33
806
原创 lintcode:Continuous Subarray Sum
Given an integer array, find a continuous subarray where the sum of numbers is the biggest. Your code should return the index of the first number and the index of the last number. (If their are duplic
2015-06-25 20:30:57
1359
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人