LeetCode/C++/35.cpp at master · strengthen/LeetCode · 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
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
__________________________________________________________________________________________________
4ms
static const auto io_opt = []() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
    return nullptr;
}();

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

        return nums.size();
    }
};
__________________________________________________________________________________________________
8ms
class Solution {
public:
    int searchInsert(vector<int>& nums, int key) {
        int low=0,high=nums.size()-1;
    int mid=0;
  while(low<=high)
  {
      mid=(low+high)/2;

      if(nums[mid]<key)
      {
          low=mid+1;
      }else
      if(nums[mid]>key)
      {
          high=mid-1;

      }
      else if(nums[mid]==key)
      {

          return mid;
      }

  }

  return low;
    }
};
__________________________________________________________________________________________________
12ms
class Solution {
public:
    int searchInsert(vector<int>& nums, int target) {
        int begin = 0;
        int length = nums.size();
        int end = length - 1;
        int median = (begin + end) / 2;
        while(begin <= end){
            if(nums[median] == target){
                return median;
            }
            else if(nums[median] < target){
                begin = median + 1;
            }
            else{
                end = median - 1;
            }
            median = (begin + end) / 2;
        }
        return begin;
    }
};
__________________________________________________________________________________________________
8672 kb
class Solution {
public:
    int searchInsert(vector<int>& nums, int target) {
        int low = 0;
        int high = (nums.size() - 1);
        int mid = 0;

        if(nums.size() == 0)
        {
            return 0;
        }

        while(low <= high)
        {
            mid = (low + high) / 2;

            if(nums[mid] == target)
            {
                return mid;
            }
            else if(nums[mid] < target)
            {
                low = mid + 1;
            }
            else
            {
                high = mid - 1;
            }
        }

        return low;
    }
};

static int x = []() {
  std::ios::sync_with_stdio(false);
  std::cin.tie(nullptr);
  return 0;
}();
__________________________________________________________________________________________________
8760 kb
static const auto _____ = []() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
    return nullptr;
}();
class Solution {
public:
    int searchInsert(vector<int>& nums, int target)
    {
        int left = 0, right = nums.size() - 1;
        while (right - left > 1)
        {
            int mid = (left + right) / 2;
            if (nums[mid] > target)
            {
                right = mid;
            }
            else if (nums[mid] < target)
            {
                left = mid;
            }
            else
            {
                return mid;
            }
        }
        if (nums[left] == target)
        {
            return left;
        }
        if (nums[right] == target)
        {
            return right;
        }
        if (nums[left] > target)
        {
            return 0;
        }
        if (nums[right] < target)
        {
            return nums.size();
        }
        return right;
    }
};
__________________________________________________________________________________________________