lexicographically smallest and largest substring in java using length k -
input: welcometojava
length:3
output:
now smallest string:ava
now largest string:wel
// assign string want process variable inputstr = "welcometojava" // define , array each sub-string. string[] substrs = new string[input.length()-2]; // fill our container iterating 0 through place of last sub string. for(int = 0; < inputstr.length()-2; i++){ // assign array members sub strings input string each starting position substrs[i] = inputstr.substring(i,i+3); } // sort , print results. arrays.sort(substrs); for(int = 0; < args.length; i++) system.out.println(substrs[i]);
Comments
Post a Comment