05 Solution Java Exercise

Solution 05

Question05:

Take an array of length n where all the numbers are

nonnegative and unique. Find the element in the array possessing the

highest value. Split the element into two parts where first part

contains the next highest value in the array and second part hold the

required additive entity to get the highest value. Print the array

where the highest value get splitted into those two parts.

Sample input: 4 8 6 3 2

Sample output: 4 6 2 6 3 2

[Solution No 05]

// Code by saqib ale

public class Main {
        public static void main(String[] args){
            int[] array = {4,10,6,3,2};
            int maxValue = 0, secondMaxvalue =0;
            int temp, RequiredNumber =0;
            boolean flag ;
    
            // find the max value of array so i set size 5
            for(int i = 0; i< 5; i++){
                flag = true;
                if(array[i] > maxValue){
                    secondMaxvalue = maxValue;
                    maxValue = array[i];
                    flag = false;
                }
                if(array[i] > secondMaxvalue && flag){
                    secondMaxvalue = array[i];
                }
            }
            temp = maxValue;
            while(maxValue > secondMaxvalue){
                RequiredNumber++;
                maxValue--;
            }
            maxValue = temp;
            System.out.print("OuptPUt Array: ");
            for(int i =0; i<5; i++){
                if(array[i] == maxValue){
                    System.out.print( secondMaxvalue+ ", "+ RequiredNumber +", ");
                }
                else{
                    System.out.print(array[i]+", ");
                }
            }
            System.out.println("\n\n");
    
        }
        
    }

Output

java 05 solution

05 Solution Java Exercise

Solution 05

Question05:

Output

0 Response to "05 Solution Java Exercise "

Post a Comment