1002 A+B for Polynomials（java)

最新推荐文章于 2024-07-21 22:40:32 发布

原创最新推荐文章于 2024-07-21 22:40:32 发布 · 504 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

标签

#算法

本文介绍了一种解决多项式加法问题的算法实现，通过读取两个多项式的系数和指数，将相同指数的项进行系数相加，最终输出结果。算法使用Java实现，包括输入处理、多项式加法逻辑及格式化输出。

This time, you are supposed to find A+B where A and B 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:

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.

Output Specification:

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.

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

思路：

输入两个多项式，每行代表一个多项式，每行第一个数字表示该多项式有几项，后面每项中包含一个指数，一个系数；输出为项数，每项指数和系数。求两个多项式之和，即将指数相同的项的系数相加。

代码如下：

import java.text.DecimalFormat;
import java.util.Scanner;

public class Main {
	public static void main(String[] args) {
		Scanner sc=new Scanner(System.in);
		double []arr=new double[1005];
		DecimalFormat df=new DecimalFormat("#.0");
		int k,x,n=0;
		double y;
        //输入第一行多项式
		k=sc.nextInt();
		for(int i=0;i<k;i++) {
			x=sc.nextInt();
			y=sc.nextDouble();
			arr[x]+=y;
		}
        //输入第二行多项式
		k=sc.nextInt();
		for(int i=0;i<k;i++) {
			x=sc.nextInt();  
			y=sc.nextDouble();
			arr[x]+=y;
		}
		for(int i=0;i<1001;i++) {
			if(arr[i]!=0) n++;
		}
		System.out.print(n);
		for(int i=1000;i>-1;i--) {
			if(arr[i]!=0)
				System.out.print(" "+i+" "+df.format(arr[i]));
		}
	}
}