- 博客(10)
- 资源 (2)
- 收藏
- 关注
原创 LeetCode | 53. Maximum Subarray | Easy | DP
QuestionGiven an integer array nums, find the contiguous subarray (containing at least one number) which has the largest sum and return its sum.ExampleInput: [-2,1,-3,4,-1,2,1,-5,4], Output: 6 E...
2019-06-21 14:01:21 176
原创 LeetCode | 35. Search Insert Position | Easy
QuestionGiven a sorted array and a target value, return the index if thetarget is found. If not, return the index where it would be if it were inserted in order.You may assume no duplicates in the...
2019-06-20 14:53:18 146
原创 LeetCode | 283. Move Zeroes | Easy
QuestionsGiven an array nums, write a function to move all 0’s to the end of itwhile maintaining the relative order of the non-zero elements.You must do this in-place without making a copy of the ...
2019-06-20 13:58:00 109
原创 LeetCode | 27. Remove Element | Easy
QuestionGiven an array nums and a value val, remove all instances of that value in-place and return the new length.Do not allocate extra space for another array, you must do this by modifying the i...
2019-06-20 11:46:12 132
深入解析SAS数据处理、分析优化与商业应用
2017-04-24
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人