2020年05月_哈哈哈哈哈haha

转载 STL总结之unordered_set/unordered_multiset

参考链接：https://blog.csdn.net/YangLei253/article/details/97621684 介绍unordered_set 是一个封装哈希表的无序容器，其中每个元素仅可出现一次。unordered_multi

2020-05-31 20:37:13 583

转载 C++复习（八）：STL库之set、multiset、unordered_set、unordered_multiset

参考链接：https://blog.csdn.net/cly141220010/article/details/104619744/?utm_medium=distribute.pc_relevant.none-task-blog-baidujs-1 set表示一个排好序的集合，其包含的元素是唯一的，set中的元素会自动排序，不能直接修改它的元素值。set的底层数据结构是红黑树的变体，插入和删除操作比vector快。

2020-05-31 20:34:51 159

原创 leetcode | 33. 搜索旋转排序数组

class Solution {public: int search(vector<int>& nums, int target) { auto it = find(nums.begin(), nums.end(), target); if(it == nums.end()) { return -1; } return distance(nums.begin(), it);.

2020-05-31 16:58:10 67

原创 leetcode | 905. 按奇偶排序数组

class Solution {public: vector<int> sortArrayByParity(vector<int>& A) { vector<int> ou; vector<int> ji; vector<int> res; for(int i = 0; i < A.size(); i++) { if(A.

2020-05-31 15:45:26 133

原创 leetcode | 1287. 有序数组中出现次数超过25%的元素

//方法一class Solution {public: int findSpecialInteger(vector<int>& arr) { int n = arr.size(); int span = n / 4 + 1; for (int i = 0; i < n; i += span) { auto [iter_l, iter_r] = equal_range(arr.begin(), a.

2020-05-31 15:28:07 155

原创 leetcode | 面试题56 - II. 数组中数字出现的次数 II

class Solution {public: int singleNumber(vector<int>& nums) { set<int64_t> s; int64_t temp = 0; for(int i = 0; i < nums.size(); i++) { temp += nums[i]; } for(int i = 0; i .

2020-05-31 15:02:25 127

原创 leetcode | 面试题58 - II. 左旋转字符串

class Solution {public: string reverseLeftWords(string s, int n) { string str = s + s; string res; for(int i = n; i < s.size() + n; i++) { res += str[i]; } return res; }};

2020-05-31 14:26:44 130

原创 leetcode | 796. 旋转字符串

class Solution {public: bool rotateString(string A, string B) { if(A.size() != B.size()) { return false; } return (A + A).find(B) != string::npos; }};

2020-05-31 14:05:38 153

原创 leetcode | 459. 重复的子字符串

class Solution {public: bool repeatedSubstringPattern(string s) { return (s + s).find(s, 1) != s.size(); }};

2020-05-31 13:49:35 105

原创 leetcode | 面试题 17.06. 2出现的次数

class Solution {public: int numberOf2sInRange(int n) { if(n < 2) { return 0; } int left; int right = 0; int index = 0; int cur = 0; int res = 0; while(n) {.

2020-05-31 10:33:35 164

原创 leetcode |面试题43. 1～n整数中1出现的次数

class Solution {public: int countDigitOne(int n) { if(n == 0) { return 0; } int left; int right = 0; int index = 0; int cur = 0; int res = 0; while(n) { .

2020-05-31 10:29:25 145

原创 leetcode | 233. 数字 1 的个数

class Solution {public: int countDigitOne(int n) { if(n < 0) { return 0; } int left; int right = 0; int index = 0; int cur = 0; int res = 0; while(n) { .

2020-05-31 10:23:29 710

原创 leetcode | 537. 复数乘法

class Solution {public: string complexNumberMultiply(string a, string b) { int ap = distance(a.begin(), find(a.begin(), a.end(), '+')); string strRea_1; for(int i = 0; i < ap; i++) { strRea_1 += a[i]; .

2020-05-31 00:13:04 122

原创 leetcode |面试题 10.03. 搜索旋转数组

class Solution {public: int search(vector<int>& arr, int target) { if(find(arr.begin(), arr.end(), target) != arr.end()) { return distance(arr.begin(), find(arr.begin(), arr.end(), target)); } ret.

2020-05-30 20:14:18 205

原创 leetcode | 面试题 01.03. URL化

class Solution {public: string replaceSpaces(string S, int length) { string temp; for(int i = 0; i < length; i++) { temp += S[i]; } string res; for(int i = 0; i < temp.size(); i++) .

2020-05-30 19:37:54 427

原创 leetcode | 面试题 01.02. 判定是否互为字符重排

class Solution {public: bool CheckPermutation(string s1, string s2) { sort(s1.begin(), s1.end()); sort(s2.begin(), s2.end()); if(s1 == s2) { return true; } return false; }};

2020-05-30 19:27:50 89

原创 leetcode | 面试题 01.01. 判定字符是否唯一

class Solution {public: bool isUnique(string astr) { if(astr.size() <= 1) { return true; } sort(astr.begin(), astr.end()); for(int i = 0; i < astr.size() - 1; i++) { if(ast.

2020-05-30 19:22:53 209

原创 leetcode | 面试题 08.06. 汉诺塔问题

class Solution {public: void hanota(vector<int>& A, vector<int>& B, vector<int>& C) { //方法一 C = A; //方法二 //swap(A, C); }};

2020-05-30 18:45:24 184

原创 leetcode | 面试题 01.09. 字符串轮转

class Solution {public: bool isFlipedString(string s1, string s2) { if(s1.size() == 0 && s2.size() == 0) { return true; } if(s1.size() != 0 && s2.size() == 0) { return fa.

2020-05-30 16:55:08 181

原创 leetcode | 260. 只出现一次的数字 III

class Solution {public: vector<int> singleNumber(vector<int>& nums) { vector<int> vec; sort(nums.begin(), nums.end()); for(int i = 0; i < nums.size() - 1; i += 2) { if(nums[i] != nu.

2020-05-30 16:14:07 79

转载 C/C++开发工程师面试题目总结（自己面试经历+部分转载）

参考链接：https://blog.csdn.net/sebastian_tan/article/details/94661644 C/C++开发工程师面试题目总结1. C和C++的区别是什么？2. 关键字static、const、extern作

2020-05-30 15:42:47 338

转载 STL简介和常见的面试题

参考链接：https://blog.csdn.net/dreamispossible/article/details/89442263?utm_medium=distribute.pc_relevant.none-task-blog-BlogCommendFromMachineLearnPai2-6.nonecase&depth_1-utm_source=distribute.pc_relevant.none-task-blog-BlogCommendFromMachineLearnPai2-6.n

2020-05-30 15:38:50 182

转载 STL笔试面试题总结（干货）

参考链接：https://blog.csdn.net/zzb2019/article/details/81195294?utm_medium=distribute.pc_relevant.none-task-blog-BlogCommendFromMachineLearnPai2-2.nonecase&depth_1-utm_source=distribute.pc_relevant.none-task-blog-BlogCommendFromMachineLearnPai2-2.nonecase

2020-05-30 15:34:19 651

转载 C/C++ 最常见50道面试题

参考链接：https://blog.csdn.net/BostonRayAlen/article/details/93041395?utm_medium=distribute.pc_relevant.none-task-blog-BlogCommendFromMachineLearnPai2-1.nonecase&depth_1-utm_source=distribute.pc_relevant.none-task-blog-BlogCommendFromMachineLearnPai2-1.non

2020-05-30 15:08:30 513

空空如也

空空如也