m0_47411878的博客

数组（简单）剑指 Offer 03. 数组中重复的数字剑指 Offer 11. 旋转数组的最小数字剑指 Offer 03. 数组中重复的数字class Solution {public: int findRepeatNumber(vector<int>& nums) { unordered_map<int, int> res; for(int i = 0; i < nums.size(); i++){

数组（简单88. 合并两个有序数组88. 合并两个有序数组方法一class Solution {public: void merge(vector<int>& nums1, int m, vector<int>& nums2, int n) { int l = 0, r = 0; vector<int> res; while(l < m && r < n){

数组35. 搜索插入位置53. 最大子序和35. 搜索插入位置class Solution {public: int searchInsert(vector<int>& nums, int target) { int l = 0, r = nums.size() - 1; while(l <= r){ int mid = l + (r - l) / 2; if(nums[mid] &lt

数组一1. 两数之和26. 删除有序数组中的重复项27. 移除元素1. 两数之和class Solution {public: vector<int> twoSum(vector<int>& nums, int target) { unordered_map<int, int> a; for(int i = 0; i < nums.size(); i++){ if(a.find(targ