首页 > 其他 > 详细

Microsoft - Union Two Sorted List with Distinct Value

时间:2018-04-29 10:06:25      阅读:198      评论:0      收藏:0      [点我收藏+]

Union Two Sorted List with Distinct Value

 

  • Given X = { 10, 12, 16, 20 } &  Y = {12, 18, 20, 22}
  • We would like to find out the union of two sorted arrays.
  • Union of X U Y is {10, 12, 16, 18, 20, 22}

 

Array:

    public static List<Integer> unionTwoSortedArray(int[] arr1, int[] arr2){
        int len1 = arr1.length;
        int len2 = arr2.length;
        int i = 0;
        int j = 0;
        List<Integer> list = new ArrayList<>();
        while(i<len1 && j<len2){
            if(arr1[i] < arr2[j]){
                list.add(arr1[i]);
                i++;
            }
            else if(arr1[i] > arr2[j]){
                list.add(arr2[j]);
                j++;
            }
            else{
                list.add(arr2[j]);
                i++;
                j++;
            }
        }
        while(i<len1){
            list.add(arr1[i]);
            i++;
        }
        while(j<len2){
            list.add(arr2[j]);
            j++;
        }
        return list;
    }

 

Microsoft - Union Two Sorted List with Distinct Value

原文:https://www.cnblogs.com/incrediblechangshuo/p/8970166.html

(0)
(0)
   
举报
评论 一句话评论(0
关于我们 - 联系我们 - 留言反馈 - 联系我们:wmxa8@hotmail.com
© 2014 bubuko.com 版权所有
打开技术之扣,分享程序人生!