给定一个字符串 s ,请你找出其中不含有重复字符的 最长子串的长度。 示例1: "abc" 示例2: "b" 示例3: "wke" 题解:滑动窗口 class Solution { public: int lengthOfLongestSubstring(string s) { unordered_map<char, int> window; int len = 0; int left = 0, right = 0; while(right < s.siz...
class Solution { public int lengthOfLongestSubstring(String s) { if (s == null || s.length() == 0) return 0; int from = 0, to = 1, length = 1, maxLength = 0; // to遍历直到字符串末尾 while (to < s.length()){ int site = s.substring(from, to).indexOf(s.charAt(to))...
classSolution{publicintlengthOfLongestSubstring(String s){intans=0; Map<Character, Integer> map =newHashMap<>();for(intl=0, r =0; r < s.length(); ++r) {charc=s.charAt(r);if(map.containsKey(c) && l <= map.get(c)) { l = map.get(c) +1; }else{ ans = Math.max(r - ...
public class Solution { public int lengthOfLongestSubstring(String s) { int n = s.length(); Set<Character> set = new HashSet<>(); int ans = 0, i = 0, j = 0; while (i < n && j < n) { // try to extend the range [i, j] if (!set.contains(s.charAt(j))){ set.add...
publicintlengthOfLongestSubstring2(String s){int[] set =newint[256];intn=s.length(), left =0, right =0;intresult=0;for(inti=0; i<n; i++) { left = i; right = i;while(right < n && ++set[s.charAt(right)] <2) {
1publicclassSolution {2publicintlengthOfLongestSubstringKDistinct(String s,intk) {3intl=0, r=0;4HashMap<Character, Integer> map =newHashMap<Character, Integer>();5intlongest = 0;6if(s==null|| s.length()==0 || k<=0)returnlongest;7while(r <s.length()) {8charcur =s.charAt(r)...
* https://leetcode.com/problems/longest-substring-without-repeating-characters * brutal force * @param {string} s * @return {number} */ var lengthOfLongestSubstring = function(s) { var n = s.length, ans = 0; /** * @param s String ...
陆陆续续在LeetCode上刷了一些题,一直没有记录过,准备集中整理记录一下 classSolution{publicintlengthOfLongestSubstring(String s){if(s.length()<2){returns.length();}intmax=0;List<Character>list=newArrayList<>();for(inti=0;i<s.length()-1;i++){list.clear();for(intj=i;j<s.length();j++...
python代码: classSolution:deflengthOfLongestSubstring(self,s):""":type s:str:rtype:int"""iflen(s)==0:return0res=0left=0right=0hashset={}whileright<len(s):whileright<len(s)and s[right]notinhashset:hashset[s[right]]=rightright+=1ifright<len(s)and s[right]inhashset:ifhashset[...
3.无重复字符的最长子串(Longest Substring Without Repeating Characters)4.寻找两个有序数组的中位数(Median of Two Sorted Arrays)5.最长回文子串(Longest Palindromic Substring)6. Z字形变换(ZigZag Conversion)7.整数反转(Reverse Integer)8.字符串转换整数(atoi) (String to Integer (atoi))9.回文数(...