Advertisement
zoltanvi

Merge two sorted arrays INTERVIEW QUESTION

Jul 16th, 2018
115
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
Java 1.22 KB | None | 0 0
  1. public class Main {
  2.  
  3.     public static void main(String[] args) {
  4.         int[] a = {0, 2, 4, 6, 8, 10, 11};
  5.         int[] b = {1, 6, 9, 12, 42};
  6.  
  7.         int[] res = mergeSortedArrays(a, b);
  8.  
  9.         for (int i = 0; i < res.length; i++) {
  10.             if(i != res.length - 1)
  11.                 System.out.print(res[i] + ", ");
  12.             else
  13.                 System.out.print(res[i]);
  14.         }
  15.  
  16.     }
  17.  
  18.  
  19.     // You are given two sorted int arrays, A and B.
  20.     // Write a method to merge B into A in sorted order.
  21.     public static int[] mergeSortedArrays(int[] a, int[] b){
  22.         int[] merged = new int[a.length + b.length];
  23.         int i = 0;
  24.         int j = 0;
  25.         for (int l = 0; l < merged.length; l++) {
  26.             if(i < a.length && j < b.length){
  27.                 if(a[i] <= b[j]){
  28.                     merged[l] = a[i];
  29.                     i++;
  30.                 } else {
  31.                     merged[l] = b[j];
  32.                     j++;
  33.                 }
  34.             } else if(i < a.length && j >= b.length){
  35.                 merged[l] = a[i];
  36.                 i++;
  37.             } else {
  38.                 merged[l] = b[j];
  39.                 j++;
  40.             }
  41.         }
  42.  
  43.         return merged;
  44.     }
  45.  
  46. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement