1 Importjava.util.Arrays;2 ImportJava.util.Scanner;3 Public classMain {4 Public Static voidMain (String args[]) {5Scanner Scanner =NewScanner (system.in);6 while(Scanner.hasnext ()) {7String str =scanner.nextline ();8string[] Arrstr = Str.split ("");9 int[] Arrnum =New int[arrstr.length];Ten int[] Arrout =New int[arrstr.length]; One for(inti = 0; i < arrstr.length; i++){ AArrnum[i] =Integer.parseint (Arrstr[i]); -Arrout[i] = 0; - } the intOutPut = arrnum[0]; - for(inti = 0; i < arrnum.length; i++){ - for(intj = 0; J < Arrnum.length; J + +){ - if(I >=j) { +ARROUT[J] + =Arrnum[i]; - if(Arrout[j] >OutPut) { +OutPut =Arrout[j]; A } at } - } - } - System.out.println (outPut); - } - } in}
2.
1 Importjava.util.Arrays;2 ImportJava.util.Scanner;3 Public classMain {4 Public Static voidMain (String args[]) {5Scanner Scanner =NewScanner (system.in);6 while(Scanner.hasnext ()) {7String str =scanner.nextline ();8 intn =scanner.nextint ();9string[] Arrstr = Str.split ("");Ten int[] Arrnum =New int[arrstr.length]; One for(inti = 0; i < arrstr.length; i++){ AArrnum[i] =Integer.parseint (Arrstr[i]); - } - Arrays.sort (arrnum); the System.out.println (Arrnum[n]); - } - }18}
The topic is not difficult, the emphasis is input.
"Drip test" 1. The maximum and 2 of consecutive arrays. Find out the number of K in the array