[PAT] 1002 A+B for Polynomials （25 分）Java

This time, you are supposed to find A+BA+BA+B where AAA and BBB are two polynomials.

Input Specification:

Each input file contains one test case. Each case occupies 2 lines, and each line contains the information of a polynomial:

KKK N1N_1N​1​​aN1a_{N_1}a​N​1​​​​N2N_2N​2​​aN2a_{N_2}a​N​2​​​​ ... NKN_KN​K​​aNKa_{N_K}a​N​K​​​​

where KKK is the number of nonzero terms in the polynomial, NiN_iN​i​​ and aNia_{N_i}a​N​i​​​​ (i=1,2,⋯,Ki=1, 2, cdots , Ki=1,2,⋯,K) are the exponents and coefficients, respectively. It is given that 1≤K≤101 le K le 101≤K≤10，0≤NK<⋯<N2<N1≤10000 le N_K < cdots < N_2 < N_1 le 10000≤N​K​​<⋯<N​2​​<N​1​​≤1000.

Output Specification:

For each test case you should output the sum of AAA and BBB in one line, with the same format as the input. Notice that there must be NO extra space at the end of each line. Please be accurate to 1 decimal place.

Sample Input:

2 1 2.4 0 3.2
2 2 1.5 1 0.5

Sample Output:

3 2 1.5 1 2.9 0 3.2

 * @Auther: Xingzheng Wang
 * @Date: 2019/1/17 12:49
 * @Description: PACKAGE_NAME
 * @Version: 1.0
 */

import java.util.Scanner;

public class PAT1002 {
    public static void main(String[] args) {

        double[] a = new double[1001];
        int k = 0;

        Scanner sc = new Scanner(System.in);
        k = sc.nextInt();
        while (k != 0) {
            int index = sc.nextInt();
            double n = sc.nextDouble();
            a[index] += n;
            k--;
        }

        k = sc.nextInt();
        while (k != 0) {
            int index = sc.nextInt();
            double n = sc.nextDouble();
            a[index] += n;
            k--;
        }

        for (int i = 0; i <= 1000; i++) {
            if (a[i] != 0) {
                k++;
            }
        }

        System.out.print(k);
        if (k != 0) {
            System.out.print(" ");
        }
        for (int i = 1000; i >= 0; i--) {
            if (a[i] != 0) {
                System.out.printf("%d ", i);
                System.out.printf("%.1f", a[i]);
                k--;
                if (k != 0) {
                    System.out.print(" ");
                }
            }
        }
    }
}