Leetcode 937. Reorder Log Files🇮🇳🇮🇳🇮🇳, Java

Language: Layout:

//'main' method must be in a class 'Rextester'.
//Compiler version 1.8.0_111

//Leetcode 937. Reorder Log Files

import java.util.*;
import java.lang.*;

class Rextester
{  
    public static void main(String args[])
    {
        System.out.println("Hello, World!");
        String[] logs = {"a1 9 2 3 1","g1 act car","zo4 4 7","ab1 off key dog","a8 act zoo"};
        String[] out = reorderLogFiles(logs);
        for(String s:out)
            System.out.println(s);
    }

public static String[] reorderLogFiles(String[] logs) {
        Comparator<String> myComp = new Comparator<String>(){
            @Override
            public int compare(String s1,String s2){
                  
                //get indices of start of content
                int i1 = s1.indexOf(' ');
                int i2 = s2.indexOf(' ');
                
                //get content
                String cont1 = s1.substring(i1+1);
                String cont2 = s2.substring(i2+1);

//if s1 is digitstring
                if(cont1.charAt(0)<='9'){
                    //if s2 is digit
                    if(cont2.charAt(0)<='9')
                        return 0;
                    else
                        return 1;
                }
               if(cont2.charAt(0)<='9')
                    return -1;

//compare s1, s2 - both are letterstrings
                if(cont1.equals(cont2)){
                    //compare identifiers and return appropriate
                    return s1.substring(0,i1).compareTo(s2.substring(0,i2));
                }
                else
                    return cont1.compareTo(cont2);
            }

};

Arrays.sort(logs,myComp);
        return logs;
    }
}

[ + ] Show input
Compilation time: 0.93 sec, absolute running time: 0.16 sec, cpu time: 0.13 sec, memory peak: 18 Mb, absolute service time: 1,1 sec