BigNumberPlus大数加法

/*
BigNumberPlus(char* strNumLeft, char* strNumRight)
@author arhaiyun
*/
#include "stdafx.h"
#include <iostream>
#include <assert.h>
#include <string.h>


using namespace std;
char* BigNumberPlus(char* strNumLeft, char* strNumRight)
{
	assert(strNumLeft != NULL && strNumRight != NULL);


	int lenLeft = strlen(strNumLeft);
	int lenRight = strlen(strNumRight);
	
	int maxLen = lenLeft > lenRight ? lenLeft : lenRight;
	
	char* result = new char[maxLen + 2];
	memset(result, 0, sizeof(char) * (maxLen + 2));
	result[0] = '0';
	
	int i = lenLeft - 1;
	int j = lenRight - 1;
	int k = maxLen;
	
	while(i >=0 && j >= 0)
	{
		result[k--] = strNumLeft[i--] + strNumRight[j--] - '0';
	}


	if(i >= 0)
	{
		while(i >= 0)
			result[k--] = strNumLeft[i--];
	}
	
	if(j >= 0)
	{
		while(j >= 0)
			result[k--] = strNumLeft[j--];
	}
	
	for(i = maxLen; i > 0; i--)
	{
		if(result[i] > '9')
		{
			result[i] -= 10;
			result[i - 1] += 1;
		}
	}
	
	size_t pos = strspn(result, "0");


	printf("%s\n", result + pos);
	
	return result;
}




int main(int argc, char* argv[])
{
	char strNum1[] = "7897912345678910";
	char strNum2[] = "98765432189";
	
	BigNumberPlus(strNum1, strNum2);

	system("pause");
	return 0;
}


本版中只有一个用于生产环境的文件:BigDecimal-all-last.min.js,大小为26K,如果WEB服务器打开GZIP压缩,可以减小至7K,如需完整版本请移步至:http://download.youkuaiyun.com/detail/aquaqu2009/4575230 简单用法: var scale = 20; var e = new BigDecimal("0"); var denominator = new BigDecimal("1"); var eBefore = new BigDecimal("-1"); var iteration = 1; while (!e.equals(eBefore)) { eBefore = e; e = e.add(BigDecimal.prototype.ONE.divide(denominator, scale, BigDecimal.prototype.ROUND_HALF_UP)); denominator = denominator.multiply(new BigDecimal(iteration+'')); ++iteration; } equal(e.toString(), "2.71828182845904523536"); ok(new BigDecimal("1234.5678").isPositive(), "1234.5678 is positive"); ok(new BigDecimal("-1234.5678").isNegative(), "-1234.5678 is negative"); ok(!BigDecimal.prototype.ZERO.isPositive() && !BigDecimal.prototype.ZERO.isNegative(), "BigDecimal.prototype.ZERO is neither positive nor negative"); ok(BigDecimal.prototype.ZERO.isZero(), "BigDecimal.prototype.ZERO is zero"); ok(new BigDecimal("1234.0000").isLessThan(new BigDecimal("1234.5678")) && new BigDecimal("1234.0000").isLessThanOrEqualTo(new BigDecimal("1234.5678")), "1234.0000 is less than 1234.5678"); ok(!new BigDecimal("1234.0000").isGreaterThan(new BigDecimal("1234.5678")) && !new BigDecimal("1234.0000").isGreaterThanOrEqualTo(new BigDecimal("1234.5678")), "1234.0000 is not greater than 1234.5678"); ok(new BigDecimal("1234.5678").isGreaterThan(new BigDecimal("1234.0000")) && new BigDecimal("1234.5678").isGreaterThanOrEqualTo(new BigDecimal("1234.0000")), "1234.5678 is greater than 1234.0000"); ok(!new BigDecimal("1234.5678").isLessThan(new BigDecimal("1234.0000")) && !new BigDecimal("1234.5678").isLessThanOrEqualTo(new BigDecimal("1234.0000")), "1234.5678 is not less than 1234.0000"); ok(new BigDecimal("1234.5678").isLessThanOrEqualTo(new BigDecimal("1234.5678")) && new BigDecimal("1234.5678").isGreaterThanOrEqualTo(new BigDecimal("1234.5678")), "1234.5678 is less than or equal to itself as well as greater than or equal to itself"); 别整个复制粘贴啊,那样是运行不起来的,请粘贴您需要的代码,,
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值