//35
class Solution {
public:
int searchInsert(vector<int>& s, int tar) {
int i = 0;
for (; i < s.size(); i++)
if (s[i] >= tar) return i;
return i;
}
};
LeetCode35. 搜索插入位置
最新推荐文章于 2024-07-19 19:25:43 发布
//35
class Solution {
public:
int searchInsert(vector<int>& s, int tar) {
int i = 0;
for (; i < s.size(); i++)
if (s[i] >= tar) return i;
return i;
}
};