704.二分查找
1.关于[Left,Right]区间规则的写法
对于Left==Right是有意义的,所以在写while(Left<=Right)时,需注重<=。其次middle=Left+((Right-Left)/2)
class Solution {
public:
int search(vector<int>& nums, int target) {
int Left = 0;
int Right = nums.size()-1;
while(Left<=Right){
int middle = Left + ((Right - Left)/2);
if(nums[middle]<target){
Left = middle+1;
}else if(nums[middle]>target){
Right = middle-1;
}else{
return middle;
}
}
return -1;
}
};
2.关于[Left,Right)区间规则的写法
对于Left==Right的不存在的,所以需要注意的是,此时Right=nums().size,且当缩小范围时,应该将Right=middle。
class Solution {
public:
int search(vector<int>& nums, int target) {
int Left = 0;
int Right = nums.size();
while(Left < Right){
int middle = Left +((Right-Left)>>2);
if(nums[middle]<target){
Left = middle +1;
}else if(nums[middle]>target){
Right = middle;
}else{
return middle;
}
}
return -1;
}
};
27.移除元素
1.暴力求解
遇到val对应值后,将后面元素向前推一格,覆盖掉之前的元素。
class Solution {
public:
int removeElement(vector<int>& nums, int val) {
int size = nums.size();
for(int i=0;i<size;i++){
if(nums[i]==val){
for(int j=i+1;j<size;j++){
nums[j-1]=nums[j];
}
i--;
size--;
}
}
return size;
}
};
2.双指针法
慢指针指向被更新位置,快指针进行循环,作用于一个数组
class Solution {
public:
int removeElement(vector<int>& nums, int val) {
int SlowIndex=0;
//int FastIndex=0;
int size=nums.size();
for(int FastIndex=0;FastIndex<size;FastIndex++){
if(nums[FastIndex]!=val){
nums[SlowIndex]=nums[FastIndex];
SlowIndex++;
}
}
return SlowIndex;
}
};
977.有序数组的平方
1.暴力求解
直接平方然后在排序
class Solution {
public:
vector<int> sortedSquares(vector<int>& nums) {
int size=nums.size();
for(int i=0;i<size;i++){
nums[i]=(nums[i])*(nums[i]);
}
sort(nums.begin(),nums.end());
return nums;
}
};
2.双指针法
for循环的终止条件应为i<=j
class Solution {
public:
vector<int> sortedSquares(vector<int>& nums) {
int k=nums.size()-1;
int j=nums.size()-1;
int size=nums.size();
vector<int> A(size);
for(int i=0;i<=j;){
if((nums[i]*nums[i])<(nums[j]*nums[j])){
A[k] = (nums[j]*nums[j]);
k--;
j--;
}else{
A[k]=(nums[i]*nums[i]);
k--;
i++;
}
}
return A;
}
};