Advertisement
BITWIS3

SuccessivePlay

Nov 16th, 2017
98
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
Java 1.34 KB | None | 0 0
  1. import java.util.ArrayList;
  2. import java.util.Collections;
  3.  
  4. public class Action {
  5.     public static void main(String[] args) {   
  6.            
  7.         long start = System.nanoTime();  
  8.         String givenNumber = "75478569123456871234567854123456701234567892452655";   
  9.         String foundNumber = findTheLargestSuccessiveNumber(givenNumber);
  10.         long elapsedTime = System.nanoTime() - start;      
  11.         System.out.print("time: " + elapsedTime + " nanoseconds"
  12.                         + "\nLargest successive Number: " + foundNumber );     
  13.     }
  14.     public static String findTheLargestSuccessiveNumber(String givenNumber) {
  15.         String finalFoundNumber = "0";
  16.         int tempFoundNumber = 0;
  17.         int length = givenNumber.length();
  18.         ArrayList<String> list = new ArrayList<>();
  19.         ArrayList<Integer> list2 = new ArrayList<>();
  20.         int x = 0;     
  21.         for (int i = 0; i<length; i++) {       
  22.             x = Character.getNumericValue(givenNumber.charAt(i));          
  23.             if(x == tempFoundNumber + 1) {
  24.                 finalFoundNumber = finalFoundNumber + x;
  25.                 tempFoundNumber = Integer.valueOf(finalFoundNumber);
  26.                 list.add(finalFoundNumber);
  27.             }else {
  28.                 finalFoundNumber = "";                         
  29.             }          
  30.             tempFoundNumber = x;   
  31.         }
  32.         int aLength = list.size();
  33.         for(int i = 0; i < aLength; i++) {
  34.             list2.add(Integer.parseInt(list.get(i).toString()));
  35.         }
  36.         finalFoundNumber = String.valueOf(Collections.max(list2));     
  37.         return finalFoundNumber;
  38.     }
  39.  
  40. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement