leetcode:最长不重复子串hash表解法
leetcode 最长不重复子串:利用hash表解决:class Solution {public: int lengthOfLongestSubstring(string s) { int begin(0), end(0); int sSize = int(s.size()); int len=0; int maxLen = 0; unordered_map<char,int> hash;
原创
2021-06-05 15:30:07 ·
144 阅读 ·
0 评论