算法第四版1.4算法分析：习题1.4.12

import edu.princeton.cs.algs4.StdOut;
import edu.princeton.cs.algs4.StdRandom;

import java.util.Arrays;

public class E1_4_12 {
    public static void main(String[]args){
        //测试算法
        int[]a={1,2,3,3,4,5,6,7,8};
        int[]b={3,3,3,4,5,6,7,8};
        Stack<Integer> stack=findCommInt(a,b);
        for (int i:stack)
            StdOut.print(i+" ");
        StdOut.println();

        //DoublingRatio测试速度
        int N=125;
        double prev=timeTrial(N);
        for (N=250;true;N+=N){
            double now=timeTrial(N);
            StdOut.printf("N=%8d time=%7.1f ratio=%4.1f\n",N,now,now/prev);
            prev=now;
        }
    }
    public static double timeTrial(int N){
        int MAX=1000000;
        int[] a=new int[N];
        int[] b=new int[N];
        for (int i=0;i<N;i++){
            a[i]= StdRandom.uniform(-MAX,MAX);
            b[i]=StdRandom.uniform(-MAX,MAX);
        }
        Arrays.sort(a);
        Arrays.sort(b);
        StopWatch time=new StopWatch();
        Stack<Integer> stack=findCommInt(a,b);
        return time.elapsedTime();
    }

    public static Stack<Integer> findCommInt(int[]a, int[]b){
        Stack<Integer> stack=new Stack<>();
        for (int i=a.length-1,j=b.length-1;i>=0&&j>=0;){
            if (a[i]>b[j]) i--;
            else if (a[i]<b[j]) j--;
            else {//包括去除重复
                if (stack.isEmpty()) stack.push(a[i]);
                else {
                    int temp=stack.pop();
                    if (temp==a[i]);
                    else
                        stack.push(temp);
                    stack.push(a[i]);
                }
                i--;j--;
            }
        }
        return stack;
    }
}