力扣704-二分查找
#include<iostream>
#include<vector>
using namespace std;
class Solution{
public:
int search(vector<int>& nums,int target){
int left=0;
int right=nums.size()-1;
while(left<=right){
int middle;
middle=left+(right-left)/2;
if(nums[middle] > target){
right=middle-1;
}
else if(nums[middle] < target){
left=middle+1;
}
else return middle;
}
return -1;
}
};
int main(){
int n;
cin>>n;
vector<int> nums(n);
for(int i=0;i<n;i++){
cin>>nums[i];
}
int target;
cin>>target;
Solution sol;
cout<<sol.search(nums,target)<<endl;
}
class Solution{
public:
int search(vector<int>& nums,int target){
int n=nums.size();
for(int i=0;i<n;i++){
if(nums[i]==target){
return i;
}
}
return -1;
}
};
力扣27-移除元素
class Solution {
public:
int removeElement(vector<int>& nums, int val) {
int length=nums.size();
for(int i=0;i<length;i++){
if(nums[i]==val){
nums.erase(nums.begin() + i);
length--;
i--;
}
}
for(int i=0;i<length;i++){
cout<<nums[i];
}
return length;
}
};
#include<iostream>
#include<vector>
using namespace std;
class Solution {
public:
int removeElement(vector<int>& nums, int val) {
int length=nums.size();
int left=0;
for(int right=0;right<length;right++){
if(nums[right] != val){
nums[left]=nums[right];
left++;
}
}
for(int i=0;i<left;i++){
cout<<nums[i];
}
return left;
}
};
int main(){
int n;
cin>>n;
vector<int> nums(n);
for(int i=0;i<n;i++){
cin>>nums[i];
}
int val;
cin>>val;
Solution sol;
cout<<sol.removeElement(nums,val)<<endl;
}