定義結(jié)點類

public class PolyNode {/*** 定義結(jié)點系數(shù)域*/private int coef;/*** 定義結(jié)點指數(shù)域*/private int exp;/*** 定義結(jié)點后繼引用域*/private PolyNode next;/*** 無參數(shù)構(gòu)造器* 構(gòu)造空結(jié)點*/public PolyNode() {this.next = null;}/*** 有參數(shù)構(gòu)造器* 初始化系數(shù)、指數(shù)* @param coef* @param exp*/public PolyNode(int coef, int exp) {super();this.coef = coef;this.exp = exp;}public int getCoef() {return coef;}public void setCoef(int coef) {this.coef = coef;}public int getExp() {return exp;}public void setExp(int exp) {this.exp = exp;}public PolyNode getNext() {return next;}public void setNext(PolyNode next) {this.next = next;}}

對應(yīng)單鏈表的實現(xiàn)

public class PolynomialList {/*** 頭引用*/protected PolyNode first;/*** 尾插法實現(xiàn)構(gòu)造器* @param initialList*/public PolynomialList(String[] initialList) {//頭引用初始化為頭結(jié)點first = new PolyNode();//初始化尾引用，實現(xiàn)未插入PolyNode rear = first;for (int i = 0; i < initialList.length; i++) {//以逗號分離系數(shù)、指數(shù)String[] polyInfo = initialList[i].split(",");int coef = Integer.parseInt(polyInfo[0]);int exp = Integer.parseInt(polyInfo[1]);//生成多項式結(jié)點PolyNode node = new PolyNode(coef, exp);rear.setNext(node);rear = node;}}public void printpolynomial() {PolyNode node = first;StringBuilder str = new StringBuilder();while (node != null) {if (node.getCoef() != 0) {str.append(node.getCoef() + "x^" + node.getExp());//System.out.print();if (node.getNext() != null) {str.append(" + ");} else {str.append(".");}}node = node.getNext();}System.out.println(str);}}

多項式操作類

public class Polynomial {public PolynomialList addPolynomial(String[] initialA, String[] initialB) {//初始化一元多項式A、B的單鏈表PolynomialList polyA = new PolynomialList(initialA);PolynomialList polyB = new PolynomialList(initialB);//初始化工作引用pre、pPolyNode pre = polyA.first, p = pre.getNext();//初始化工作引用qPolyNode q = polyB.first.getNext();PolyNode qTemp;while (p != null && q != null) {//第一種情況if (p.getExp() < q.getExp()) {pre = p;p = p.getNext();} else if (p.getExp() > q.getExp()) { //第二種情況qTemp = q.getNext();pre.setNext(q);q.setNext(p);q = qTemp;} else { //第三種情況//系數(shù)相加p.setCoef(p.getCoef() + q.getCoef());//系數(shù)為0if (p.getCoef() == 0) {pre.setNext(p.getNext());p = pre.getNext();} else { //系數(shù)不為0pre = p;p = p.getNext();}q = q.getNext();}}if (q != null) {//將q連接到第一個鏈表之后pre.setNext(q);}return polyA;}}

測試

public class PolynomialTester {public static void main(String[] args) {String[] initialA = {"3,0", "3,1", "3,4"};String[] initialB = {"3,0", "3,2", "3,3", "4,7"};Polynomial polynomial = new Polynomial();PolynomialList list = polynomial.addPolynomial(initialA, initialB);list.printpolynomial();}}

運行結(jié)果

6x^0 + 3x^1 + 3x^3 + 3x^4 + 4x^7.

總結(jié)

以上是生活随笔為你收集整理的【Java】链表求解一元多项式加法的全部內(nèi)容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網(wǎng)站內(nèi)容還不錯，歡迎將生活随笔推薦給好友。