Find the next greater number

Given a number find the smallest number that is greater than n, and has same number of digits as n.

 
Input:  n = "218765"
Output: "251678"

Input:  n = "1234"
Output: "1243"

Input: n = "4321"
Output: "Not Possible"

Input: n = "534976"
Output: "536479"

 Steps:

 Consider  3,2,8,4,1

 1. Start from right and find the digit that is smaller than its next digit.
    3,2 < 8 >4 >1

2. Swap that digit with its next higher number in the right.

     3, 2, 8, 4 , 1    (next higher digit of 2 is 4)

     3,4,8,2,1

 3. Reverse the digits to the right of that digit (4).

    3,4,1,2,8
Code:

 import java.util.*;

 public class Solution {
    
    static void findNextGreater(int[] a){
        int n = a.length;
        int position = -1;
        
        for(int i=n-1; i>0; i--){
            if(a[i]>a[i-1]){
                position = i-1;
                break;
            }
        }
        
        int smallest = position+1;
        
        //here we have to find the next higher number. The number has to be higher than a[position]
        //and smaller than other digits, we initialize smallest to a[poisition+1] as it is
        // higher than a[poistion]
        for(int i=position+2; i<n; i++){
            if(a[i]>a[position] && a[i] < a[smallest])
                smallest = i;
        }
        
        swap(a, position,smallest);
        reverse(a, position+1);
        
    }
    
    static void swap(int[] a, int position, int nexthigh){
        int temp = a[position];
        a[position] = a[nexthigh];
        a[nexthigh] = temp;
    }
    
    static void reverse(int[] a, int start){
        int n = a.length;
        for(int i=start, j=n-1; i<j; i++,j--){
            int temp = a[i];
            a[i] = a[j];
            a[j] = temp;
        }
    }
    
    public static void main(String[] args) {
        int[] a = {3,2,8,4,1} ;
        findNextGreater(a);
        for(int i=0; i<a.length; i++){
            System.out.print(a[i]);
        }
     }
}
Output:

 
34128



Comments

Post a Comment

Popular posts from this blog

Rearrange Array in Maximum-Minimum form

Given a sorted array of positive integers, rearrange the array alternately i.e first element should be the maximum value, second minimum value, third-second max, fourth-second min and so on. Naive Solution: Here we will use an auxiliary array to store the elements in correct order. For even indices of the array  Large numbers from the given array are added. For odd indices small numbers are added. Code: import java.util.*; public class Test{        public static void main(String[] args) {          Scanner in = new Scanner(System.in);     int[] a = {1,2,3,4,5,6,7,8,9};     int n = a.length;     int[] temp = new int[n];     int small = 0;     int large = n-1;     for(int i=0; i<n; i++){         if(i%2 == 0){             temp[i] = a[large--];         }         else{             temp[i] = a[small++];         }              }     for(int i=0; i<n; i++){         System.out.print(temp[i]+" ");     }            
Read more

Second Largest Element

Given an array of integers, our task is to write a program that efficiently finds the second largest element present in the array. Example: Input : arr[] = {12, 35, 1, 10, 34, 1} Output : The second largest element is 34. Code: package sap; public class SecondLargest {         public static void main(String[] args){                 int[] a = {89, 24, 75, 11, 23};         int max = Integer.MIN_VALUE, secondMax = Integer.MIN_VALUE;                 for(int i=0; i<a.length; i++){                         if(a[i] > max){                                 secondMax = max;                 max = a[i];                             }             else if(a[i] > secondMax){                 secondMax = a[i];             }                     }                 System.out.println("The second maximum element is "+secondMax);             } } Output: The second maximum element is 75
Read more

Check if a number is a power of another number

Check if a number is a power of another number Input: x = 10, y = 1 Output: True x^0 = 1 Input: x = 10, y = 1000 Output: True x^3 = 1 Input: x = 10, y = 1001 Output: False Code: package sap; public class Power {         public static void main(String[] args){                int x = 27, y = 729;                 int val = (int)Math.log(y)/ (int)Math.log(x);                 double res = Math.log(y)/Math.log(x);                 if(val == res){             System.out.println(x+" can be expressed as a power of "+y);         }                 else{             System.out.println(x +" cannot be expressed as a power of "+y);         }             } } Output: 27 can be expressed as a power of 729
Read more