LeetCodeKotlin/src/com/boycoder/problems/pointers/Easy_35_SearchInsertPosition.kt at main · chaxiu/LeetCodeKotlin · GitHub

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
package com.boycoder.problems.pointers

import com.boycoder.utils.asserts

/**
 * @Author: zhutao
 * @datetime: 2021/6/21
 * @desc:
 */
object Easy_35_SearchInsertPosition {

    /**
     * 1, 3, 5, 6
     * |        |
     *
     * 1, 3, 5, 6
     *    |     |
     *
     * 1, 3, 5, 6
     *    |     |
     * 1, 3, 5, 6
     *    |  |
     */
    fun searchInsert(nums: IntArray, target: Int): Int {
        var left = 0
        var right = nums.size - 1

        while (left <= right) {
            val mid = (right + left) /2
            if (target > nums[mid]) {
                left = mid + 1
            } else if (target < nums[mid]) {
                right = mid - 1
            } else {
                return mid
            }
        }

        return left
    }
}

fun main() {
    val res = Easy_35_SearchInsertPosition.searchInsert(intArrayOf(1,3,5,6), 5)
    asserts(res, 2)
    val res1 = Easy_35_SearchInsertPosition.searchInsert(intArrayOf(1,3,5,6), 2)
    asserts(res1, 1)
}