myJavaExamples/LongestSubstringWithoutRepeatingCharacters.java at master · fatihozdil/myJavaExamples · 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
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
/*
 @author Muhammed Fatih ÖZDİL
 @since 07/03/2021

*/
package algorithmExamples;

public class LongestSubstringWithoutRepeatingCharacters {
public static boolean check(String str) {
    for (int i = 0; i < str.length(); i++) {
        for (int j = i+1; j < str.length(); j++) {
            if(str.charAt(i)== str.charAt(j)){
            return false;
            }
        }
    }
    return true;
}
    public static void findLongest(String str) {
        boolean check = check(str);
        if(check){

          System.out.println(str);
        }
        String[] arr = new String[str.length()];
        for (int i = 0; i < str.length(); i++) {
           for (int j = 1; j < str.length(); j++) {
             check =     check(str.substring(i, str.length()-j));
             if(check){

           arr[i] = str.substring(i, str.length()-j);

                break;
              }
           }
        }
        for (int k = 0; k < arr.length; k++) {
            for (int k2 = 1; k2 < arr.length; k2++) {
              if (arr[k] != null && arr[k2] != null){
                if (arr[k].length() > arr[k2].length())
                    arr[k2] = arr[k];
                else
                    arr[k] = arr[k2];
        }
              }
        }
        System.out.println(arr[0]);
    }
    public static void main(String[] args) {
        String str = "pickoutthelongestsubstring";

            findLongest(str);
    }
}