大数减法



#include <iostream>
#include <cstring>
#include <cstdio>
using namespace std;
int max(int m,int n)
{
    if(m>n)
    return m;
    return n;
}
int compare(char *str_a,char *str_b)
{
    int len_a, len_b;
    len_a = strlen(str_a);          //分别获取大数的位数进行比较
    len_b = strlen(str_b);

    if ( strcmp(str_a, str_b) == 0 )    //返回比较结果
        return 0;
    if ( len_a > len_b )
        return 1;
    else if( len_a == len_b )
        return strcmp(str_a, str_b);
    else
        return -1;
}
int main()
{
    int f, n;
    int i, k;
    char str_a[1000], str_b[1000];
    int num_a[1000] ;          //初始化大数数组,各位全清0
    int num_b[1000] ;
    int num_c[1000];

    while (scanf("%s%s",str_a,str_b)!= EOF) //可进行多组测试
    {
        memset(num_a,0,sizeof(num_a));
        memset(num_b,0,sizeof(num_b));
       int  len_a = strlen(str_a);         //分别获得两个大数的位数
       int  len_b = strlen(str_b);

        k = max(len_a,len_b)  ;                 //获得最大的位数;
        num_c[0] = 0;
        f = 0;
        n = compare(str_a,str_b);
        for (i=0;i<len_a;i++)                   //颠倒存储
            num_a[i] = str_a[len_a-i-1] - '0';
        for (i=0;i<len_b;i++)
            num_b[i] = str_b[len_b-i-1] - '0';

        for (i=0;i<k;i++)         //逐位进行减法
        {
            if (n>=0)
            {
                if (num_a[i] >= num_b[i])
                    num_c[i] = num_a[i] - num_b[i];
                else
                {
                    num_c[i] = num_a[i] - num_b[i] + 10;
                    num_a[i+1]--;
                }
            }
            else
            {
                if ( num_b[i] >= num_a[i])
                    num_c[i] = num_b[i] - num_a[i];
                else
                {
                    num_c[i] = num_b[i] - num_a[i] + 10;
                    num_b[i+1]--;
                }
            }

        }
        if (n<0)            //按要求打印
            printf("-");
        for (i=k-1; i>=0; i--)
        {
            if (num_c[i])
                f = 1;
            if (f || i == 0 )
                printf("%d",num_c[i]);
        }
        printf("\n");
    }
    return 0;
}


  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
以下是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; } } ```
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值