2019年1月7日
[Lintcode]56. Two Sum
摘要： 56. Two SumDescriptionTwo SumGiven an array of integers, find two numbers such that they add up to a specific target number.The f... 阅读全文
posted @ 2019-01-07 21:32 siriusli 阅读(116) 评论(0) 推荐(0)
[Lintcode]64. Merge Sorted Array
摘要： 64. Merge Sorted ArrayDescriptionGiven two sorted integer arrays A and B, merge B into A as one sorted array.ExampleA = [1, 2, 3,... 阅读全文
posted @ 2019-01-07 21:20 siriusli 阅读(92) 评论(0) 推荐(0)
[Lintcode]100. Remove Duplicates from Sorted Array
摘要： 100. Remove Duplicates from Sorted ArrayDescriptionGiven a sorted array, remove the duplicates in place such that each element ap... 阅读全文
posted @ 2019-01-07 21:00 siriusli 阅读(127) 评论(0) 推荐(0)
[Lintcode]138. Subarray Sum
摘要： 138. Subarray SumDescriptionGiven an integer array, find a subarray where the sum of numbers is zero. Your code should return the... 阅读全文
posted @ 2019-01-07 20:47 siriusli 阅读(212) 评论(0) 推荐(0)
[Lintcode] 172. Remove Element
摘要： 172. Remove ElementDescriptionGiven an array and a value, remove all occurrences of that value in place and return the new length... 阅读全文
posted @ 2019-01-07 20:35 siriusli 阅读(120) 评论(0) 推荐(0)