刷 LeetCode 从零开始学 GoLang（11）：35. Search Insert Position_golang[leetcode]35.search insert position-CSDN博客

本文链接：https://blog.csdn.net/yanglingwell/article/details/102620302

题目描述

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

GoLang 语法：goroutine 和 channel

goroutine 是轻量级线程，goroutine 的调度是由 Golang 运行时进行管理的：

go function_name( argument_list )

通道（channel）是用来传递数据的一个数据结构
操作符 <- 用于指定通道的方向，发送或接收。如果未指定方向，则为双向通道
带缓冲区的通道允许发送端的数据发送和接收端的数据获取异步操作，不带缓冲区的通道则是同步发送和获取数据的

AC 代码

func syncSearch(out  chan<- int, nums []int, target int) {
    // SearchInts searches for x in a sorted slice of ints and 
    // returns the index as specified by Search. 
    // The return value is the index to insert x if x is not 
    // present (it could be len(a)). 
    // The slice must be sorted in ascending order.
    ans := sort.SearchInts(nums, target)
    out <- ans
}

func searchInsert(nums []int, target int) int {
    in := make(chan int)
    go syncSearch(in, nums, target)
     
    return <- in
}