用链表的方式实现大数相减-Java实现


package com.company;

import java.util.Objects;

public class Main {

  public static void main(String[] args) {
    // write your code here
    String num1 = "30000001";
    String num2 = "1000003";
    if (!isDigitalNum(num1) || !isDigitalNum(num2)) {
      System.out.println("数值不合法");
      return;
    }

    Node node1 = new Node.Builder().setNumber(num1).build();
    Node node2 = new Node.Builder().setNumber(num2).build();
    String result = node1.next.add(node2.next, 0);
    for (int i = 0; i < result.length(); ++i) {
      if (result.charAt(i) != '0') {
        System.out.println(result.substring(i));
        break;
      }
    }
  }

  private static boolean isDigitalNum(String num) {
    if (Objects.isNull(num) || "".equals(num))
      return false;
    for (int i = 0; i < num.length(); i++) {
      if (num.charAt(i) < '0' && num.c
  • 1
    点赞
  • 7
    收藏
    觉得还不错? 一键收藏
  • 1
    评论
以下是Java链表实现大数减法的示例代码: ```java import java.util.*; public class BigIntegerSubtraction { public static void main(String[] args) { // 生成两个随机数 String num1 = generateRandomNumber(); String num2 = generateRandomNumber(); System.out.println("num1: " + num1); System.out.println("num2: " + num2); // 将两个数存储到链表中 LinkList list1 = new LinkList(); LinkList list2 = new LinkList(); for (int i = num1.length() - 1; i >= 0; i--) { list1.Insert(num1.charAt(i) - '0'); } for (int i = num2.length() - 1; i >= 0; i--) { list2.Insert(num2.charAt(i) - '0'); } // 对两个链表进行减法操作 LinkList result = new LinkList(); int borrow = 0; Node p = list1.front, q = list2.front; while (p != null || q != null) { int x = p != null ? p.data : 0; int y = q != null ? q.data : 0; int z = x - y - borrow; if (z < 0) { z += 10; borrow = 1; } else { borrow = 0; } result.Insert(z); if (p != null) { p = p.next; } if (q != null) { q = q.next; } } // 输出结果 System.out.print("result: "); result.PrintList(); } // 生成1~50位的随机数 public static String generateRandomNumber() { Random random = new Random(); int length = random.nextInt(50) + 1; StringBuilder sb = new StringBuilder(); for (int i = 0; i < length; i++) { sb.append(random.nextInt(10)); } return sb.toString(); } } class LinkList { public Node front; public int length = 0; public LinkList() { front = null; } public void Insert(int data) { Node newNode = new Node(data); if (front == null) { front = newNode; } else { Node p = front; while (p.next != null) { p = p.next; } p.next = newNode; } length++; } public void GetList() { Node p = front; while (p != null) { System.out.print(p.data + " "); p = p.next; } System.out.println(); } public void PrintList() { Node p = front; while (p != null && p.data == 0) { p = p.next; } if (p == null) { System.out.print("0"); } else { while (p != null) { System.out.print(p.data); p = p.next; } } System.out.println(); } public int GetRear() { Node p = front; while (p.next != null) { p = p.next; } return p.data; } } class Node { public int data; public Node next; public Node(int data) { this.data = data; next = null; } } ```
评论 1
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值