姚军

题目链接二分法固定一个数组对另外两个数组二分注意处理边界#include <iostream>#include <cstring>#include <algorithm>using namespace std;const int N = 1e5+5;int a[N], b[N], c[N];int main(){ int n; scanf("%d", &n); for(int i = 0; i < n;

题目类型：二分搜索题意：从有序数组中查找某个元素第一次出现的位置class BinarySearch {public: int getPos(vector<int> A, int n, int val) { int l = 0, r = n-1; while(l < r){ int mid = (l + r)...

二分难度：简单推荐学习视频：花花酱class Solution {public: char nextGreatestLetter(vector<char>& letters, char target) { //2020.2.27 二分 左闭有开 int n = letters.size(); int l = 0, ...

51nod题目链接使用递推先计算出long long范围内的只包含235因子的数经过测试在11000个数内注意：输入的数的范围是long long范围#include <cstdio>#include <algorithm>#include <iostream>using namespace std;const int N = 11000;c...

二分模板题题目链接两段性#include <string>#include <vector>#include <iostream>#include <algorithm> using namespace std;vector<int> nums;int main(){ int n, k, x; cin>&gt...

#include <cstdio>#include <algorithm>using namespace std;const int maxn = 100010;int n,p,a[maxn];int main(){ scanf("%d%d",&n,&p); for(int i=0;i<n;i++){ scanf("%d",&...

题目链接#include<iostream>using namespace std;const int N = 1e5+7;int nums[N];int main(){ int n, k, x; cin>>n; for(int i = 0; i < n; i++){ cin>>nums[i]; } cin >> k;...

这道题明明很简单，但是我也弄了好久。之前yxc讲的是从n-1开始，但是这里弄了从l开始。可能还是不熟悉二分吧，还要多理解。class Solution {public: char nextGreatestLetter(vector<char>& letters, char target) { int l = 0, r = letters.size...

class Solution {public: int singleNonDuplicate(vector<int>& nums) { int l = 0, r = nums.size()-1; while(l < r){ int mid = l + (r - l) / 2; int...

#include <iostream>#include <vector>#include <algorithm>#include <cstdio>using namespace std;vector<int> nums;int main(){ char c; int x; while(scanf("%d", &x...

#include <unordered_map>#include <iostream>#include <vector> using namespace std;int main(){ int x; char c; vector<int> nums; while(cin>>x){ c = getchar(); nu...

花花酱class Solution {public: int findKthNumber(int m, int n, int k) { int l = 1, r = m*n; while(l < r){ int mid = l + (r -l)/2; if(les(m, n, mid) >= k...

花花酱class Solution {public: vector<int> kthSmallestPrimeFraction(vector<int>& A, int K) { const int n = A.size(); double l = 0, r = 1.0; while(l < r){ ...

class Solution {public: int findDuplicate(vector<int>& nums) { int l = 1, r = nums.size() - 1; while(l < r){ int mid = l + r >> 1; int c...

不完全单调的数据使用二分还是有点没弄懂class Solution {public: int findPeakElement(vector<int>& nums) { int l = 0, r = nums.size() - 1; while(l < r){ int mid = l + r >&g...

check函数直接调用API// Forward declaration of isBadVersion API.bool isBadVersion(int version);class Solution {public: int firstBadVersion(int n) { int l = 0, r = n; while(l < r){...

这道题很好，考查了二分法方法1进制转换本身是很简单的，但是本题涉及的进制最高可达整形上界，所以暴力查找肯定是不行的，其次二分法上界和下界的确定很关键。二分查找的进制下界很容易理解，就是字符串中数字的最大值加1，上界假设字符串2的累加和等于字符串1的十进制值res，此时的进制即为所求的进制，故有:∑i=0len2−1str2[i]∗radix(len2−1−i)=res\sum\limits...

输入n(≤105)n(\le 10^5)n(≤105),找出其中2个数之和等于mmm解法一：暴力枚举 O(n2)O(n^2)O(n2)解法二：二分搜索O(nlogn)O(nlogn)O(nlogn)先对数组排序，然后对数组中的每个arr[i]，二分查找m-arr[i]解法三：双指针O(nlogn)O(nlogn)O(nlogn)先对数组排序，然后使用两个指针，i=0,j=n−1i=0,j...

快速幂最后一个测试点：输入：1 0 1输出：1^0 mod 1=0版本1#include<cstdio>typedef long long LL;int main(){ LL b,p,k; LL ans=1; scanf("%lld%lld%lld",&b,&p,&k); printf("%lld^%lld mod %lld=",b,p...

这道题确实有点超出我的能力范围，参考了别人的博客，下面这个版本是我能懂也是大致想到但是无法实现的代码。注意：起止范围是从1开始的当然也有用二分法解的，等我刷第二遍的时候再来补吧。#include<bits/stdc++.h>using namespace std;int main(){ int n,m,p,q=1,ans=0,M=0x7fffffff; cin>&...

经典的双指针题题目链接#include<bits/stdc++.h>using namespace std;const int maxn=1e5+5;int v[maxn];int main(){ int n,m; cin>>n>>m; for(int i=0;i<n;i++){ cin>>v[i]; } sort(v...

题目链接传统DP时间复杂度是O(n2)O(n^2)O(n2)有四个测试点会超时使用二分优化到O(nlogn)O(nlogn)O(nlogn)博客参考AC代码#include<cstdio>#include<iostream>#include<algorithm>using namespace std;const int maxn =5e4+5...

二分法模板二class Solution {public: int mySqrt(int x) { int l = 0, r = x; while(l < r){ int mid = l + r + 1ll >> 1; if(mid <= x / mid) l = mid; ...

二分模板库大于等于用lower_bound(first, last, target)大于用upper_bound(first, last, target)版本1class Solution {public: int searchInsert(vector<int>& nums, int target) { return lower_bound(...

版本1class Solution {public: vector<int> searchRange(vector<int>& nums, int target) { int a, b; if(find(nums.begin(), nums.end(), target) == nums.end()) { ...

class Solution {public: bool searchMatrix(vector<vector<int>>& matrix, int target) { if(!matrix.size() || !matrix[0].size()) return false; int n = matrix.size(), m...

class Solution {public: int findMin(vector<int>& nums) { int l = 0, r = nums.size() - 1; while(l < r){ int mid = l + r >> 1; if(nums[mid]...

class Solution {public: int search(vector<int>& nums, int target) { if(nums.empty()) return -1; int l = 0, r = nums.size() - 1; while(l < r){ int ...

人见人爱A^B Problem Description 求A^B的最后三位数表示的整数。 说明：A^B的含义是“A的B次方”Input 输入数据包含多个测试实例，每个实例占一行，由两个正整数A和B组成（1&lt;=A,B&lt;=10000），如果A=0, B=0，则表示输入数据的结束，不做处理。Output 对于每个测试实例，请输出A^B的最后三位表示的整数，每个输出占一行。...