siriusli - 博客园

2019年2月9日

摘要： "75. Find Peak Element" Description There is an integer array which has the following features: The numbers in adjacent positions are different. A[0] 阅读全文

posted @ 2019-02-09 01:17 siriusli 阅读(107) 评论(0) 推荐(0)

2019年2月4日

[Lintcode] 14. First Position of Target

摘要： 14. First Position of TargetDescriptionFor a given sorted array (ascending order) and a target number, find the first index of th... 阅读全文

posted @ 2019-02-04 17:51 siriusli 阅读(115) 评论(0) 推荐(0)

[Lintcode]141. Sqrt(x)

摘要： 141. Sqrt(x)DescriptionSqrt(x)Implement int sqrt(int x).Compute and return the square root of x.ExampleExample 1:Input: 0Output:... 阅读全文

posted @ 2019-02-04 02:22 siriusli 阅读(148) 评论(0) 推荐(0)

[Lintcode]60. Search Insert Position

摘要： 60. Search Insert PositionDescriptionGiven a sorted array and a target value, return the index if the target is found. If not, re... 阅读全文

posted @ 2019-02-04 02:02 siriusli 阅读(126) 评论(0) 推荐(0)

[Lintcode]28. Search a 2D Matrix

摘要： 28.Search a 2D MatrixDescriptionDescriptionWrite an efficient algorithm that searches for a value in an m x n matrix.This matrix ... 阅读全文

posted @ 2019-02-04 01:51 siriusli 阅读(136) 评论(0) 推荐(0)

[lintcode]31. Partition Array

摘要： 31. Partition ArrayDescriptionGiven an array nums of integers and an int k, partition the array (i.e move the elements in “nums”)... 阅读全文

posted @ 2019-02-04 01:10 siriusli 阅读(234) 评论(0) 推荐(0)

[leetcode]15. 3Sum

摘要： 15. 3SumDescriptionGiven an array nums of n integers, are there elements a, b, c in nums such that a + b + c = 0? Find all unique... 阅读全文

posted @ 2019-02-04 00:39 siriusli 阅读(104) 评论(0) 推荐(0)

[Lintcode] 59. 3Sum Closest

摘要： 59. 3Sum ClosestDescriptionGiven an array S of n integers, find three integers in S such that the sum is closest to a given numbe... 阅读全文

posted @ 2019-02-04 00:32 siriusli 阅读(99) 评论(0) 推荐(0)

2019年1月8日

[Lintcode]189. First Missing Positive

摘要： 189. First Missing PositiveDescriptionGiven an unsorted integer array, find the first missing positive integer.ExampleGiven [1,2,... 阅读全文

posted @ 2019-01-08 15:23 siriusli 阅读(163) 评论(0) 推荐(0)

[Lintcode]50. Product of Array Exclude Itself

摘要： 50. Product of Array Exclude ItselfDescriptionGiven an integers array A.Define B[i] = A[0] * … * A[i-1] * A[i+1] * … * A[n-1], ca... 阅读全文

posted @ 2019-01-08 14:27 siriusli 阅读(135) 评论(0) 推荐(0)

公告