有序集合的交集

最新推荐文章于 2025-08-16 17:02:07 发布

转载最新推荐文章于 2025-08-16 17:02:07 发布 · 92 阅读

0 ·

CC 4.0 BY-SA版权

原文链接：https://my.oschina.net/dylan2hdf/blog/1305755

文章标签：

#python

2019独角兽企业重金招聘Python工程师标准>>>


/**  两个有序集合的交集
 * @author HDF
 *
 */
public class Test {

    public static void main(String args[]){
        int[] b = {4, 6, 7, 7, 7, 7, 8, 8, 9, 10, 100, 130, 130, 140, 150};
        int[] a = {2, 3, 4, 4, 4, 4, 7, 8, 8, 8, 8, 9, 100, 130, 150, 160};
        int[] c = intersect(a, b);
        System.out.println(Arrays.toString(c));
    }

    public static int[] intersect(int[] a, int[] b) {
    	//直接排除交集为空的情况
        if(a[0] > b[b.length - 1] || b[0] > a[a.length - 1]) {
            return new int[0];
        }
        int[] intersection = new int[Math.max(a.length, b.length)];
        int offset = 0;
        for(int i = 0, s = i; i < a.length && s < b.length; i++) {
        	System.out.println(i);
            while(a[i] > b[s]) {
                s++;
            }
            if(a[i] == b[s]) {
                intersection[offset++] = b[s++];
            }
            while(i < (a.length - 1) && a[i] == a[i + 1]) {
                i++;
            }
        }
        if(intersection.length == offset) {
            return intersection;
        }
        int[] duplicate = new int[offset];
        System.arraycopy(intersection, 0, duplicate, 0, offset);
        return duplicate;
    }
}

转载于:https://my.oschina.net/dylan2hdf/blog/1305755