从零开始刷PAT(A+B for Polynomials)

---

题目描述
This time, you are supposed to find A+B where A and B are two polynomials.

输入描述
Each input file contains one test case. Each case occupies 2 lines, and each line contains the information of a polynomial:
K N1 aN1 N2 aN2 … NK aNK, where K is the number of nonzero terms in the polynomial, Ni and aNi (i=1, 2, …, K) are the exponents and coefficients, respectively. It is given that 1 <= K <= 10，0 <= NK < … < N2 < N1 <=1000.

输出描述
For each test case you should output the sum of A and B 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.

解题思路
题目要求输出两个多项式相加后的多项式，其中K是多项式的非零项个数，Ni是非零项的幂，aNi是非零项的系数，最后还要求小数要精确到1位。
可以考虑到：

1. 两个多项式相加结果最多项数就是两个多项式分别的项数和
2. 同幂数的项相加合为一项
3. 不算K的话，幂在数列里的下标为偶数，系数为奇数
   通过以上思路，我们可以创建两个float[]数组，分别用来放幂和系数，下标就与幂一一对应，最后同下标相加输出即可。

Java实现：

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.text.DecimalFormat;
import java.util.Arrays;
import java.util.StringTokenizer;

public class Main{
    public static void main(String[] args) throws IOException {
        BufferedReader bf = new BufferedReader(new InputStreamReader(System.in));
        StringTokenizer st = new StringTokenizer(bf.readLine());
        int k1 = 2*Integer.parseInt(st.nextToken());
        float[] pA = getPolynomials(k1,st);
        st = new StringTokenizer(bf.readLine());
        bf.close();
        int k2 = 2*Integer.parseInt(st.nextToken());
        float[] pB = getPolynomials(k2,st);
        float[] sum = getSum(pA,pB);
        StringBuilder sb = new StringBuilder(" ");
        DecimalFormat nf = new DecimalFormat(".0");
        int c = 0;
        for(int i=sum.length-1;i>-1;i--){
            if(sum[i]!=0){
                sb.append(i).append(" ").append(nf.format(sum[i])).append(" ");
                c++;
            }
        }
        sb.insert(0,c);
        sb.deleteCharAt(sb.length()-1);
        System.out.println(sb);
    }

    private static float[] getSum(float[] pA, float[] pB) {
        float[] sum = new float[1001];
        int p1=0,p2=0;
        while(p1<pA.length-1){
            sum[(int) pA[p1]]+=pA[p1+1];
            p1+=2;
        }
        while(p2<pB.length-1){
            sum[(int) pB[p2]]+=pB[p2+1];
            p2+=2;
        }
        int last = sum.length;
        while(last>0&&sum[last-1]==0) last--;
        return Arrays.copyOf(sum,last);
    }

    private static float[] getPolynomials(int n,StringTokenizer st){
        float[] p = new float[n];
        for(int i=0;i<p.length;i++){
            p[i] = Float.parseFloat(st.nextToken());
        }
        return p;
    }
}