leetcode 3번문제 Longest Substring Without Repeating Characters

문제 Given a string, find the length of the longest substring without repeating characters.

 

예시는 https://leetcode.com/problems/longest-substring-without-repeating-characters/

Longest Substring Without Repeating Characters - LeetCode

 

링크에서 확인

 

 

class Solution {
    public int lengthOfLongestSubstring(String s) {
        int resCnt = 0;
        if (s.length() > 0) {
            
            char[] a = s.toCharArray();
            
            for (int i = 0; i < a.length; i++) {
                int tempCnt = 0;
                HashMap<Character, Integer> strArr = new HashMap<Character, Integer>();
                tempCnt++;
                strArr.put(a[i],i);
                for (int j = i + 1; j < a.length; j++) {
                    if (strArr.containsKey(a[j])) {
                        break;
                    } else {
                        tempCnt++;
                    }
                    strArr.put(a[j],i);
                }
                resCnt = (tempCnt > resCnt) ? tempCnt : resCnt;
            }
        }
        return resCnt;
    }
}