Java——两个顺序链表的并交集

最新推荐文章于 2022-03-19 10:13:03 发布

AliatChiang

最新推荐文章于 2022-03-19 10:13:03 发布

阅读量2.3k

点赞数

分类专栏： Java历-例-程文章标签： java 链表数据结构

本文链接：https://blog.csdn.net/qq_24081845/article/details/52947383

版权

Java历-例-程专栏收录该内容

2 篇文章 0 订阅

订阅专栏

求两个顺序链表的交集，假设链表是递增的。

public static LinkedList<Integer> listIntersection(LinkedList<Integer> L1, LinkedList<Integer> L2){
        LinkedList<Integer> intersection = new LinkedList<>();
        Iterator<Integer> iter1 = L1.iterator();
        Iterator<Integer> iter2 = L2.iterator();
        int a = iter1.next();
        int b = iter2.next();
        while(true){
            if(a == b){
                intersection.add(a);
                if(iter1.hasNext() && iter2.hasNext()){
                    a = iter1.next();
                    b = iter2.next();
                }
                else    break;
            }
            else if (a > b) {
                if(iter2.hasNext())
                    b = iter2.next();
                else    break;
            }
            else {
                if(iter1.hasNext())
                    a = iter1.next();
                else    break;
            }
        }
        return intersection;
    }

求两个顺序链表的并集，假设链表是递增的。

public static LinkedList<Integer> listUnion(LinkedList<Integer> L1, LinkedList<Integer> L2){
        LinkedList<Integer> union = new LinkedList<>();
        Iterator<Integer> iter1 = L1.iterator();
        Iterator<Integer> iter2 = L2.iterator();
        int a = iter1.next();
        int b = iter2.next();

        while(true){
            if(a == b){
                union.add(a);
                if(iter1.hasNext() && iter2.hasNext()){
                    a = iter1.next();
                    b = iter2.next();
                }else   break;
            }
            else if (a > b) {
                union.add(b);
                if(iter2.hasNext())
                    b = iter2.next();
                else    break;
            }
            else {
                union.add(a);
                if(iter1.hasNext())
                    a = iter1.next();
                else    break;
            }
        }
        while(iter1.hasNext())  union.add(iter1.next());
        while(iter2.hasNext())  union.add(iter2.next());
        return union;
    }