摘要：
class Solution { public: bool isPalindrome(string s) { int l=0,r=s.size()-1; int p='a'-'A'; int flag=1; while(l<=r) { while(1) { if(s[l]>='A'&&s[l]<=' 阅读全文
posted @ 2022-02-05 21:00
Jerry2km1
阅读(60)
评论(0)
推荐(0)
摘要：
class Solution { public: string minWindow(string s, string t) { int n1=s.size(),n2=t.size(); string ans; if(n1<n2) return ans; int ct1[130]={0},ct2[13 阅读全文
posted @ 2022-02-05 20:51
Jerry2km1
阅读(90)
评论(0)
推荐(0)
摘要：
class Solution { public: int lengthOfLongestSubstring(string s) { int n=s.size(); if(n<2) return n; bool ct[128]={0}; int l=0,r=0,temp; int ans=0; cha 阅读全文
posted @ 2022-02-05 20:46
Jerry2km1
阅读(40)
评论(0)
推荐(0)
摘要：
class Solution { public: vector<int> findAnagrams(string s, string p) { int n1=s.size(),n2=p.size(); vector<int> ans; if(n1<n2) return ans; vector<int 阅读全文
posted @ 2022-02-05 20:42
Jerry2km1
阅读(51)
评论(0)
推荐(0)
摘要：
class Solution { public: bool checkInclusion(string s1, string s2) { int n1=s1.size(),n2=s2.size(); if(n1>n2) return false; vector<int> count1(26),cou 阅读全文
posted @ 2022-02-05 20:39
Jerry2km1
阅读(55)
评论(0)
推荐(0)
摘要：
class NumMatrix { public: vector<vector<int>> sums; NumMatrix(vector<vector<int>>& matrix) { int m = matrix.size(); if(m>0) { int n = matrix[0].size() 阅读全文
posted @ 2022-02-05 20:35
Jerry2km1
阅读(44)
评论(0)
推荐(0)
摘要：
class Solution { public: int pivotIndex(vector<int>& nums) { int n=nums.size(); if(n<=2) return -1; int presum[10010]={0}; for(int i=0;i<n;++i) { pres 阅读全文
posted @ 2022-02-05 20:01
Jerry2km1
阅读(26)
评论(0)
推荐(0)
摘要：
class Solution { public: int findMaxLength(vector<int>& nums) { int maxLength=0,counter=0,pre,temp; unordered_map<int,int> mp; //hash表存储的是counter每个取值第 阅读全文
posted @ 2022-02-05 19:26
Jerry2km1
阅读(36)
评论(0)
推荐(0)
摘要：
class Solution { public: int subarraySum(vector<int>& nums, int k) { int n=nums.size(); int presum[20010]={0}; unordered_map<int,int> mp; mp[0]=1; //前 阅读全文
posted @ 2022-02-05 19:23
Jerry2km1
阅读(54)
评论(0)
推荐(0)
摘要：
class Solution { public: int numSubarrayProductLessThanK(vector<int>& nums, int k) { if(k<2) return 0; int n = nums.size(); int i=0,j=0; int product=1 阅读全文
posted @ 2022-02-05 19:16
Jerry2km1
阅读(32)
评论(0)
推荐(0)
浙公网安备 33010602011771号