摘要: 1 for (int i=arr.size()-1;i>=0;--i) 2 { 3 srand((unsigned)time(NULL)); 4 swap(arr[rand()%(i+1)],arr[i]); 5 } [0,i]中随机选一个数,与第i个数交换 阅读全文
posted @ 2020-04-25 18:56 Jinxiaobo0509 阅读(145) 评论(0) 推荐(0)
摘要: 1 class Solution 2 { 3 public: 4 vector<int> findAnagrams(string s, string t) 5 { 6 unordered_map<char, int> need, window; 7 for (char c : t) need[c]+ 阅读全文
posted @ 2020-04-25 11:15 Jinxiaobo0509 阅读(121) 评论(0) 推荐(0)
摘要: 1 class Solution 2 { 3 public: 4 // 判断 s 中是否存在 t 的排列 5 bool checkInclusion(string t, string s) 6 { 7 unordered_map<char, int> need, window; 8 for (cha 阅读全文
posted @ 2020-04-25 11:02 Jinxiaobo0509 阅读(134) 评论(0) 推荐(0)