問題描述

例如，如何將 2^60 或 12345678901234567890123456789012345678901234567890 轉換為二進制?基本上，數字太大而無法用 Java 表示.

For instance, How would I be able to convert 2^60 or 12345678901234567890123456789012345678901234567890 to binary? Basically, numbers that are too large to represent in Java.

我將創建一個能夠表示太大數字的類.我只是很難弄清楚如何將十進制轉換為二進制.

I will be making a class that will be able to represent number that are too large. I'm just having a hard time figuring our how to convert decimal to binary.

Edit2:另外，我不允許使用 BigDecimal、BigInteger 或任何其他庫，抱歉之前沒有指定.

And also, I am not allowed to use BigDecimal, BigInteger, or any other library, sorry for not specifying earlier.

推薦答案

這是一個quik&dirty(非常非常非常臟)的代碼:

Here is a quik&dirty (very very very dirty) code:

public class BigDec2Bin {

    public static int[] string2arrayReversed( String s )
    {
        char a[] = s.toCharArray();
        int  b[] = new int[ s.length() ];
        for( int i = 0; i < a.length; i++ )
        {
            b[a.length-1-i] = a[i] - 48;
        }
        return b;
    }

    // adds two binary numbers represented as strings
    public static String add( String s1, String s2 )
    {
        String result = "", stmp;
        int[] a1, a2;
        int ctmp, mark = 0;

        // a1 should be the longer one
        a1 = string2arrayReversed( ( s1.length() > s2.length() ? s1 : s2 ) );
        a2 = string2arrayReversed( ( s1.length() < s2.length() ? s1 : s2 ) );

        for( int i = 0; i < a1.length; i++ )
        {
            ctmp = a1[i] + ( i < a2.length ? a2[i] : 0 ) + mark;

            switch( ctmp )
            {
                default:
                case 0:
                    stmp = "0";
                    mark = 0;
                    break;
                case 1:
                    stmp = "1";
                    mark = 0;
                    break;
                case 2:
                    stmp = "0";
                    mark = 1;
                    break;
                case 3:
                    stmp = "1";
                    mark = 1;
                    break;
            }

            result = stmp + result;
        }

        if( mark > 0 ) { result = "1" + result; }

        return result;
    }

    public static String dec2bin( String s )
    {
        String result = "";

        for( int i = 0; i < s.length() ; i++ )
        {
            result = add( result + "0", result + "000" );
            result = add( result, Integer.toBinaryString( s.charAt(i) - 48 ) );
        }

        return result;
    }

    public static void main( String[] args )
    {
        String dec = "12345"; // should be 11000000111001
        System.out.println( "dec2bin( " + dec + " ) = " + dec2bin( dec ) );

        dec = "12345678901234567890123456789012345678901234567890";
        System.out.println( "dec2bin( " + dec + " ) = " + dec2bin( dec ) );
    }

}

<小時>

輸出:

dec2bin(12345) = 011000000111001

dec2bin( 12345 ) = 011000000111001

dec2bin(12345678901234567890123456789012345678901234567890) =10000111001001111111011000110110100110101010111110000011110010100001010100000010011001110100011110101111100011000111111100011001011011001110001111110000101011010010

dec2bin( 12345678901234567890123456789012345678901234567890 ) = 10000111001001111111011000110110100110101010111110000011110010100001010100000010011001110100011110101111100011000111111100011001011011001110001111110000101011010010

<小時>

我的主要想法是始終使用字符串.

My main idea is to use always strings.

add - 方法將兩個二進制數相加，表示為字符串
dec2bin -方法是神奇的地方.

add -method adds two binary numbers which are represented as strings
dec2bin -method is where the magic happens.

請允許我解釋一下:

result = add( result + "0", result + "000" );

是任何給定數字乘以 10 的計算.

is a calculation to multiply any given number by 10.

將二進制數乘以 10 與將數字相加相同:

Multiplying a binary number by 10 is the same as adding the number with shifts:

x*10 <=> x<<1 + x<<3

x*10 <=> x<<1 + x<<3

result = add( result, Integer.toBinaryString( s.charAt(i) - 48 ) );

只需在結果字符串上添加下一個數字(從左到右)

just adds a the next digit (from left to right) on the result string

基本上我正在做的是例如 1234:
0*10 + 1 = 1
1*10 + 2 = 12
12*10 + 3 = 123
123*10 + 4 = 1234

Basicly what I'm doing is for example with 1234:
0*10 + 1 = 1
1*10 + 2 = 12
12*10 + 3 = 123
123*10 + 4 = 1234

但只能以二進制形式(表示為字符串).

but only in binary (represented as strings).

我希望我能幫上忙，并為我的英語不好感到抱歉.

I hope i could help and sorry for my bad english.

這篇關于如何在 Java 中將非常大的十進制數轉換為二進制數的文章就介紹到這了，希望我們推薦的答案對大家有所幫助，也希望大家多多支持html5模板網！