algorithms/atMostTwoDistinctCharacters.java at master · kjayashr/algorithms · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
class Solution {
    public int lengthOfLongestSubstringTwoDistinct(String s) {
        Map<Character,Integer> map = new HashMap<Character,Integer>();
        int end = 0; int begin = 0; int counter = 0;int maxlength = 1;int currentlength =0;
        if(s.equals("")||s == null)
            return 0;


        while(end < s.length())
        {
            char c = s.charAt(end);
            map.put(c,map.getOrDefault(c,0)+1);
            if(map.get(c)==1) counter ++;
            end ++;
            while(counter > 2)
            {
                 char temp = s.charAt(begin);
                 map.put(temp,map.get(temp)-1);
                 if(map.get(temp) == 0){ counter --;
                 }

                //System.out.println(" Begin: "+temp + " End "+ c +" Counter:"+counter);
             begin ++;

                // System.out.println("Current Length :" +currentlength  );

            }
            currentlength =(end-begin);
                 maxlength = Math.max(currentlength,maxlength);
           // System.out.println("Max Length :" +maxlength  );
        }

        return maxlength;
    }
}
/*lastseen:1/03/2019*/