Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- public class Main {
- public static void main(String[] args) {
- int[] a = {0, 2, 4, 6, 8, 10, 11};
- int[] b = {1, 6, 9, 12, 42};
- int[] res = mergeSortedArrays(a, b);
- for (int i = 0; i < res.length; i++) {
- if(i != res.length - 1)
- System.out.print(res[i] + ", ");
- else
- System.out.print(res[i]);
- }
- }
- // You are given two sorted int arrays, A and B.
- // Write a method to merge B into A in sorted order.
- public static int[] mergeSortedArrays(int[] a, int[] b){
- int[] merged = new int[a.length + b.length];
- int i = 0;
- int j = 0;
- for (int l = 0; l < merged.length; l++) {
- if(i < a.length && j < b.length){
- if(a[i] <= b[j]){
- merged[l] = a[i];
- i++;
- } else {
- merged[l] = b[j];
- j++;
- }
- } else if(i < a.length && j >= b.length){
- merged[l] = a[i];
- i++;
- } else {
- merged[l] = b[j];
- j++;
- }
- }
- return merged;
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement