【LeetCode】35.搜索插入位置
class Solution { public: int searchInsert(vector<int>& nums, int target) { int i; for(i=0;i<nums.size();i++){ if(nums[i]>=target) return i; } return i; } };
class Solution { public: int searchInsert(vector<int>& nums, int target) { int i; for(i=0;i<nums.size();i++){ if(nums[i]>=target) return i; } return i; } };