LeetCode704 二分查找
题目链接:二分查找
思路:左闭右开[left,right]
class Solution {
public:
int search(vector<int>& nums, int target) {
int mid;
int left=0,right=nums.size()-1;
while(left<=right)
{
mid=(left+right)/2;
if(nums[mid]>target)
right=mid-1;
else if(nums[mid]<target)
left=mid+1;
else
return mid;
}
return -1;
}
};
LeetCode35 搜索插入的位置
题目链接:搜索插入的位置
class Solution {
public:
int searchInsert(vector<int>& nums, int target) {
int mid;
int left=0,right=nums.size()-1;
while(left<=right)
{
mid=(left+right)/2;
if(nums[mid]<target)
left=mid+1;
else
right=mid-1;
}
return left;
}
};
LeetCode34 在排序数组中查找元素的第一个和最后一个位置
class Solution {
public:
vector<int> searchRange(vector<int>& nums, int target) {
int mid;
int left=0,right=nums.size()-1;
int first=-1,last=-1;
while(left<=right)
{
mid=(left+right)/2;
if(nums[mid]==target)
{
first=mid;
right=mid-1;
}
else if(nums[mid]>target)
right=mid-1;
else
left=mid+1;
}
left=0,right=nums.size()-1;
while(left<=right)
{
mid=(left+right)/2;
if(nums[mid]==target)
{
last=mid;
left=mid+1;
}
else if(nums[mid]>target)
right=mid-1;
else
left=mid+1;
}
return vector<int>{first,last};
}
};
LeetCode27 移除元素
题目:移除元素
思路:双指针
class Solution {
public:
int removeElement(vector<int>& nums, int val) {
int i,j;
for(i=0,j=0;j<nums.size();j++)
{
if(nums[j]!=val)
nums[i++]=nums[j];
}
return i;
}
};
acwing786 第k个数
题目:第k个数
思路:快速排序
#include <bits/stdc++.h>
using namespace std;
const int N=1e5;
int n,k;
int q[N];
void px(int q[],int l,int r)
{
if(l>=r) return;
int i=l-1,j=r+1,x=q[(l+r)/2];
while(i<j)
{
do i++;while(q[i]<x);
do j--;while(q[j]>x);
if(i<j) swap(q[i],q[j]);
}
px(q,l,j);
px(q,j+1,r);
}
int main()
{
cin>>n>>k;
for(int i=0;i<n;i++)
scanf("%d",&q[i]);
px(q,0,n-1);
printf("%d",q[k-1]);
}