我目前正在通过 Euler 项目工作,目前我需要将一个 1000 位数字拆分为一个数组。
我试过这个:
var number = big number here;
var digits = number.toString().split('');
Run Code Online (Sandbox Code Playgroud)
它适用于小数字,但只要输入足够大,数组就会采用科学记数法,例如:
[ '1', '2', '3', '1', '2', '4', 'e', '+', '2', '2' ]
Run Code Online (Sandbox Code Playgroud)
有没有解决的办法?
提前致谢!
编辑:欧拉项目中的问题 8 需要(https://projecteuler.net/problem=8)
Run Code Online (Sandbox Code Playgroud)number = "7316717653133062491922511967442657474235534919493496983520312774506326239578318016984801869478851843858615607891129494954595017379583319528532088055111254069874715852386305071569329096329522744304355766896648950445244523161731856403098711121722383113622298934233803081353362766142828064444866452387493035890729629049156044077239071381051585930796086670172427121883998797908792274921901699720888093776657273330010533678812202354218097512545405947522435258490771167055601360483958644670632441572215539753697817977846174064955149290862569321978468622482839722413756570560574902614079729686524145351004748216637048440319989000889524345065854122758866688116427171479924442928230863465674813919123162824586178664583591245665294765456828489128831426076900422421902267105562632111110937054421750694165896040807198403850962455444362981230987879927244284909188845801561660979191338754992005240636899125607176060588611646710940507754100225698315520005593572972571636269561882670428252483600823257530420752963450"; number = number.split(''); greatestvalue=0; for(i=0; i<number.length; i=i+1){ value = [parseInt(number[i],10),parseInt(number[i+1],10),parseInt(number[i+2],10),parseInt(number[i+3],10),parseInt(number[i+4],10),parseInt(number[i+5],10),parseInt(number[i+6],10),parseInt(number[i+7],10),parseInt(number[i+8],10),parseInt(number[i+9],10),parseInt(number[i+10],10),parseInt(number[i+11],10),parseInt(number[i+12],10)].reduce(function(previousValue, currentValue, currentIndex, array) { return previousValue * currentValue; }); if(value>greatestvalue){ greatestvalue=value;finalindex=i; } } i = finalindex; greatestnumbers = [number[i],number[i+1],number[i+2],number[i+3],number[i+4],number[i+5],number[i+6],number[i+7],number[i+8],number[i+9],number[i+10],number[i+11],number[i+12]]; document.write("Greatest Value: "+greatestvalue +"</br>Final Index: "+finalindex+"</br>Greatest Numbers: " + greatestnumbers);
| 归档时间: |
|
| 查看次数: |
1681 次 |
| 最近记录: |