Merge Two Arrays and Sort them in Ascending order

 Merge Two Arrays and Sort them in Ascending order


I/p:

[4,89,12,56,2,8]

[23,5,7,9,1]


O/p:

[1, 2, 4, 5, 7, 8, 9, 12, 23, 56, 89]


PROGRAM:

import java.util.*;
public class MergeSortarray {

    public static void  main(String args[])
    {
        Scanner sc=new Scanner(System.in);
        String s1=sc.next();
        String s2=sc.next();
        String s3="";
        String s4="";
        
        ArrayList<Integer> al3=new ArrayList<>();
        for(int i=0;i<s1.length();i++)
        {
            if(s1.charAt(i)=='[' || s1.charAt(i)==']')
            {
                continue;
            }
            else{
                s3+=String.valueOf(s1.charAt(i));
               
            }
        }
        String arr[]=s3.split(",");
         for(int i=0;i<s2.length();i++)
        {
            if(s2.charAt(i)=='[' || s2.charAt(i)==']')
            {
                continue;
            }
            else{
                s4+=String.valueOf(s2.charAt(i));
                
            }
           
        }
        String arr2[]=s4.split(",");
        
        
       
        for(int i=0;i<arr.length;i++)
        {
            al3.add(Integer.parseInt(arr[i]));
            
           

        }
         for(int i=0;i<arr2.length;i++)
        {
            al3.add(Integer.parseInt(arr2[i]));
        }
       
        Collections.sort(al3);
        System.out.println(al3);

    }
    
}

  //  Write a program to merge two given array and sort that array in ascending order

  //i/p:

  //[4,89,12,56,2,8]

  //[23,5,7,9,1]

 //o/p
  // [1,2,4,5,7,8,9,12,23,56,89]


Comments

Post a Comment

Popular posts from this blog

PROGRAM TO FIND FACTORIAL OF A NUMBER USING RECURSION

 PROGRAM TO FIND FACTORIAL OF A NUMBER  USING RECURSION  I/P: 3 O/P: 6 SOLUTION: package   N umbers ; import   java . util .*; public   class   Factorial  {      static   int   factorial ( int   n ) {          return  ( n  >  1 )  ?   n  *  factorial ( n - 1 )  :   1 ;        }         public   static   void   main ( String []  args ) {              Scanner   sc = new   Scanner ( System . in );             int   n  =  sc . nextInt ();                          int   result  ...
Read more

PROGRAM TO FIND THE COUNT OF PARTICULAR NUMBER IN AN ARRAY

  PROGRAM TO FIND THE COUNT OF PARTICULAR NUMBER IN AN ARRAY I/P: 5 1 0 2 0 0 O/P: 3 This program explains how many zeros present in the zero PROGRAM: import   java . util .*; public   class   ZeroCount  {      public   static   void   main ( String   args [])     {          Scanner   sc = new   Scanner ( System . in );          int   iNum = sc . nextInt ();          int   arr []= new   int [ iNum ];          for ( int   i = 0 ; i < iNum ; i ++)         {              arr [ i ]= sc . nextInt ();         }          int   count = 0 ; ...
Read more

TELEPHONE BOOK USING HASHMAP

  Sample Input 3 sam 99912222 tom 11122222 harry 12299933 sam edward harry Sample Output sam=99912222 Not found harry=12299933 Explanation We add the following    (Key,Value)  pairs to our map so it looks like this: We then process each query and print  key=value  if the queried   is found in the map; otherwise, we print  Not found . Query 0:   sam Sam is one of the keys in our dictionary, so we print  sam=99912222 . Query 1:   edward Edward is not one of the keys in our dictionary, so we print  Not found . Query 2:   harry Harry is one of the keys in our dictionary, so we print  harry=12299933 . SOLUTION: package   H acker R ank_problems . practice_problems ; import   java . util .*; import   java . io .*; public   class   TelephoneBook {      public   static   void   main ( String  [] argh ){          Scanne...
Read more