哈希表
Faith★
这个作者很懒,什么都没留下…
展开
-
每日温度
class Solution {public: vector<int> dailyTemperatures(vector<int>& T) { vector<int> res(T.size()); stack<int> s; for(int i = 0;i < T.size();i++){ while(!s.empty()&&T[s.top()] .原创 2020-11-26 14:48:52 · 126 阅读 · 0 评论 -
和为K的子数组
class Solution {public: int subarraySum(vector<int>& nums, int k) { unordered_map<int,int> map; map[0] = 1; int count = 0, pre = 0; for(auto& x : nums){ pre += x; if(map.find.原创 2020-11-26 14:46:07 · 35 阅读 · 0 评论 -
找到字符串中所有字母异位词
class Solution {public: vector<int> findAnagrams(string s, string p) { unordered_map<char,int> need, window; for(char ch : p){ need[ch]++; } int left = 0; int right = 0; int vali.原创 2020-11-26 14:47:40 · 76 阅读 · 0 评论 -
只出现一次的数字
class Solution {public: int singleNumber(vector<int>& nums) { int sum = 0; for(int i = 0; i < nums.size();i++){ sum ^= nums[i]; } return sum; }};原创 2020-11-26 14:45:59 · 33 阅读 · 0 评论 -
字母异位词分组
class Solution {public: vector<vector<string>> groupAnagrams(vector<string>& strs) { vector<vector<string>> res; map <string,vector<string> > m; for(string& s : strs){ .原创 2020-11-26 14:44:21 · 53 阅读 · 0 评论 -
无重复字符的最长子串
class Solution {public: int lengthOfLongestSubstring(string s) { int start = 0; int end = 0; int len = 0; int res = 0; while(end < s.size()){ char tmp = s[end]; for(int index = start;.原创 2020-11-26 14:44:15 · 25 阅读 · 0 评论 -
两数之和
class Solution {public: vector<int> twoSum(vector<int>& nums, int target) { int i,j; for(int i = 0;i < nums.size();i++){ for(int j = i+1;j < nums.size();j++){ if(nums[i] + nums[j] == .原创 2020-11-26 14:44:09 · 27 阅读 · 0 评论