# 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
```

## **解題思路**

{% hint style="info" %}

1. 比較target是否小於等於nums\[i]，是的話就是那個位置。
2. 要注意的是宣告i的scope。
   {% endhint %}

## 程式解答

```cpp
class Solution 
{
public:
    int searchInsert(vector<int>& nums, int target) 
    {
        int i = 0;
        
        for (i = 0; i < nums.size(); i++)
            if (target <= nums[i])
                return i;
        return i;
    }
};
```


---

# Agent Instructions: Querying This Documentation

If you need additional information that is not directly available in this page, you can query the documentation dynamically by asking a question.

Perform an HTTP GET request on the current page URL with the `ask` query parameter:

```
GET https://stanley7342.gitbook.io/programming/leetcode/35.-search-insert-position.md?ask=<question>
```

The question should be specific, self-contained, and written in natural language.
The response will contain a direct answer to the question and relevant excerpts and sources from the documentation.

Use this mechanism when the answer is not explicitly present in the current page, you need clarification or additional context, or you want to retrieve related documentation sections.