FilesExpand file tree

 master

/

SearchInsertPosition.java

Copy path

BlameMore file actions

BlameMore file actions

Latest commit

 

History

History

History

49 lines (48 loc) · 1.15 KB

 master

/

SearchInsertPosition.java

Top

File metadata and controls

• Code
• Blame

49 lines (48 loc) · 1.15 KB

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

18

19

20

21

22

23

24

25

26

27

28

29

30

31

32

33

34

35

36

37

38

39

40

41

42

43

44

45

46

47

48

49

package com.yangchd.leetcode.easy;

/**

* @author yangchd 2018/7/5.

*

* 35. Search Insert Position

* Given a sorted array and a target value, return the index if the target is found. If not, return the index where it would be if it were inserted in order.

* You may assume no duplicates in the array.

*

* Example 1:

* Input: [1,3,5,6], 5

* Output: 2

*

* Example 2:

* Input: [1,3,5,6], 2

* Output: 1

*

* Example 3:

* Input: [1,3,5,6], 7

* Output: 4

*

* Example 4:

* Input: [1,3,5,6], 0

* Output: 0

*

*/

public class SearchInsertPosition {

class Solution {

public int searchInsert(int[] nums, int target) {

if (nums.length < 1) {

return 0;

}

int low = 0;

int high = nums.length - 1;

while (low <= high) {

int index = (low + high) / 2;

if (nums[index] == target) {

return index;

}

if (nums[index] > target) {

high = index - 1;

} else {

low = index + 1;

}

}

return low;

}

}

}