RandomProgramming/src/main/java/MergeLists.java at master · avinashk/RandomProgramming · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
/**
 * Created by akumar6 on 7/31/17.
 */
public class MergeLists {

    public static void main(String args[]) {
        Integer[] list1 = {2, 5, 8, 10, 11, 13};
        Integer[] list2 = {3, 9, 14, 18, 20, 21};

        Integer[] mergedList = mergeList(list1, list2);
        printArray(mergedList);
        mergedList = mergeList(null, null);
        printArray(mergedList);
        mergedList = mergeList(new Integer[]{1}, new Integer[]{2});
        printArray(mergedList);
        mergedList = mergeList(new Integer[]{1}, null);
        printArray(mergedList);
        mergedList = mergeList(null, new Integer[]{1});
        printArray(mergedList);


    }

    private static void printArray(Integer[] mergedList) {
        for (int i = 0; i < mergedList.length; i++) {
            System.out.print(mergedList[i] + "\t");
        }
        System.out.println("\n**********\n");
    }

    private static Integer[] mergeList(Integer[] list1, Integer[] list2) {
        if (list1 == null && list2 == null) {
            return new Integer[0];
        }
        if (list1 == null || list1.length == 0){
            return list2;
        }
        if (list2 == null || list2.length == 0){
            return list1;
        }
        Integer[] mergedList = new Integer[(list1.length + list2.length)];
        for (int i = 0, j = 0, k = 0; i < list1.length || j < list2.length; ) {
            if(j == list2.length){
                mergedList[k] = list1[i];
                i++;
            }
            else if(i == list1.length){
                mergedList[k] = list2[j];
                j++;
            }
            else if (list1[i] > list2[j]) {
                mergedList[k] = list2[j];
                j++;
            }
            else if (list1[i] == list2[j]) {
                mergedList[k] = list1[i];
                k++;
                mergedList[k] = list2[j];
                i++;
                j++;
            }
            else if (list1[i] < list2[j]) {
                mergedList[k] = list1[i];
                i++;
            }
            k++;
        }
        return mergedList;
    }


}