-
Notifications
You must be signed in to change notification settings - Fork 0
/
search_insert_position.cpp
56 lines (53 loc) · 1.35 KB
/
search_insert_position.cpp
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
50
51
52
53
54
55
56
/*
* =====================================================================================
*
* Filename: search_insert_position.cpp
*
* Description: 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.
*
* Version: 1.0
* Created: 08/30/18 11:11:08
* Revision: none
* Compiler: gcc
*
* Author: Zhu Xianfeng (), [email protected]
* Organization:
*
* =====================================================================================
*/
#include <cstdio>
#include <cstdlib>
#include <vector>
// Binary search
class Solution {
public:
int searchInsert(const std::vector<int>& nums, int target) {
int i = 0;
int j = nums.size() - 1;
while (i <= j) {
const int k = (i + j) / 2;
if (nums[k] > target) {
j = k - 1;
} else if (nums[k] < target) {
i = k + 1;
} else {
return k;
}
}
return i;
}
};
int main(int argc, char* argv[]) {
std::vector<int> nums = {1, 2, 3};
if (argc > 3) {
nums.clear();
for (int i = 1; i < argc; i++) {
nums.push_back(atoi(argv[i]));
}
}
int idx = Solution().searchInsert(nums, 2);
printf("%d\n", idx);
return 0;
}