使用string实现一个用于储存那些太大而无法使用 long long 的数

类的定义：

class stringInt {
public:
    stringInt();
    stringInt(string num);
    stringInt(int num);
    stringInt operator+(stringInt & num);
    stringInt operator-(stringInt & num);

    // ... 还可以乘除之类的操作

private:
    string str;
};

所用的函数：

// 将string和int相互转换
string num2string(int num);
int string2num(string str);
int compareTwoNum(string firstStr, string secondStr);  // 比较两个用string表示的数的大小
int twoCharAdd(char ch1, char ch2, bool moreOne);  // 对两个用char表示的数的加操作
int twoCharSub(char ch1, char ch2, bool &lessOne);  // 对两个用char表示的数的减操作
void transpose(string &str);  // 将一个string转置

在对加、减操作的实现中，主要依赖stringAdd()、stringSubtract()函数，用于对两个用string表示的数做加减

具体实现：

string stringAdd(string firstStr, string secondStr)
{
    string outStr;
    int firstStrLen, secondStrLen, sum;
    firstStrLen = firstStr.length();
    secondStrLen = secondStr.length();
    bool moreOne = false;
    string temp = "";

    //cout << firstStr << endl;
    //cout << secondStr << endl;
    //cout << firstStrLen << "  " << secondStrLen << endl;

    //cout << "Init outStr: " << outStr << endl;

    if (firstStrLen >= secondStrLen) {
        //int cnt = firstStrLen;

        for (int i = firstStrLen - ; i >= ; i--) {

            //cout << "i = " << i << endl;

            if (secondStrLen > ) {
                sum = twoCharAdd(firstStr[i], secondStr[secondStrLen - ], moreOne);

                cout << "sum = " << sum << endl;

                if (sum >= ) {
                    moreOne = true;
                    outStr.append(num2string(sum - ));
                    // string 没有在字符串头部增加一个字符的函数，虽然实现这个函数并不复杂，但此处如果使用头部
                    // 增加一个元素的函数，则在每一个循环都需要使用，与使用append() 再 将结果字符串反转相比，需要
                    // 的代价相差太大，所以此处选用后一种方法
                }
                else {
                    moreOne = false;
                    outStr.append(num2string(sum));
                }

                secondStrLen--;

                //cout << "secondStrLen = " << secondStrLen << "  " << outStr << endl;

                continue;
            }

            if (moreOne) {
                sum = twoCharAdd(firstStr[i], '', moreOne);

                //cout << "No continue sum = " << sum << endl;

                if (sum >= ) {
                    moreOne = true;
                    outStr.append(num2string(sum - ));
                }
                else {
                    moreOne = false;
                    outStr.append(num2string(sum));
                }
            }
            else {
                if (i != ) {    // 当 i = 0 时，&firstStr[0] 表示整个 firstStr 字符串
                    outStr.append(&firstStr[i]);
                }
                else {
                    temp[] = firstStr[i];
                    outStr.append(temp);
                }

            }
        }
        //cout << "End for outStr = " << endl;
    }
    else {
        int cnt = secondStrLen;
        for (int i = cnt - ; i >= ; i--) {
            if (firstStrLen > ) {
                sum = twoCharAdd(firstStr[firstStrLen - ], secondStr[i], moreOne);

                if (sum >= ) {
                    moreOne = true;
                    outStr.append(num2string(sum - ));
                }
                else {
                    moreOne = false;
                    outStr.append(num2string(sum));
                }

                firstStrLen--;
                continue;
            }

            if (moreOne) {
                sum = twoCharAdd('', secondStr[i], moreOne);

                if (sum >= ) {
                    moreOne = true;
                    outStr.append(num2string(sum - ));
                }
                else {
                    moreOne = false;
                    outStr.append(num2string(sum));
                }
            }
            else {
                if (i != ) {
                    outStr.append(&secondStr[i]);
                }
                else {
                    temp[] = secondStr[i];
                    outStr.append(temp);
                }
            }
        }
    }

    transpose(outStr);

    return outStr;
}

string stringSubtract(string firstStr, string secondStr)  // 第一个是减数，第二个是被减数
{
    int firstStrLen, secondStrLen;
    string outStr;
    firstStrLen = firstStr.length();
    secondStrLen = secondStr.length();

    //cout << "初始outStr：" << outStr << endl;

    //cout << "两字符串长度为：" << firstStrLen << "  " << secondStrLen << endl;
    //cout << "两字符串为：" << firstStr << "  " << secondStr << endl;

    char ch = '';
    string minus = "-";
    bool lessOne = false;

    //cout << "compareTN: " << compareTwoNum(firstStr, secondStr) << endl;

    if (compareTwoNum(firstStr, secondStr) == ) {
        for (int i = firstStrLen - ; i >= ; i--) {
            if (secondStrLen > ) {
                int sub = twoCharSub(firstStr[i], secondStr[secondStrLen -], lessOne);

                cout << "sub = " << sub << endl;
                cout << "n2s_sub = " << num2string(sub) << endl;

                outStr.append(num2string(sub));
                secondStrLen--;

                //cout << outStr << endl;

                continue;
            }

            int sub = twoCharSub(firstStr[i], '', lessOne);
            outStr.append(num2string(sub));

            //cout << outStr << endl;
        }

        //cout << outStr << endl;
    }
    else if (compareTwoNum(firstStr, secondStr) == -) {
        for (int i = secondStrLen - ; i >= ; i--) {
            if (firstStrLen > ) {
                int sub = twoCharSub(secondStr[i], firstStr[firstStrLen - ], lessOne);
                outStr.append(num2string(sub));
                firstStrLen--;
                continue;
            }

            int sub = twoCharSub(secondStr[i], '', lessOne);
            outStr.append(num2string(sub));
        }

        //cout << "加负号前 outStr = " << outStr << endl;

        outStr.append(minus);
    }
    else {
        outStr.append(&ch);
    }

    //cout << "加负号后，转置前 outStr = " << outStr << endl;

    transpose(outStr);

    return outStr;
}

string stringMultiply(string firstStr, string secondStr)
{
    return string();
}

将string和int相互转换

string num2string(int num)
{
    //cout << "num = " << num << endl;

    stringstream ss;
    ss << num;

    string str = ss.str();

    //cout << str << endl;

    return str;
}

int string2num(string str)
{
    stringstream ss;
    ss << str;
    int num;
    ss >> num;

    return num;
}

其他的辅助函数的实现

int twoCharAdd(char ch1, char ch2, bool moreOne)
{
    int sum, num1, num2;
    num1 = string2num(&ch1);
    num2 = string2num(&ch2);

    if (moreOne) {
        sum = num1 + num2 + ;
    }
    else {
        sum = num1 + num2;
    }

    return sum;
}

void transpose(string &str)
{
    int len = str.length();

    for (int i = ; i < len / ; i++) {
        char tempChar = str[i];
        str[i] = str[len -  - i];
        str[len -  - i] = tempChar;
    }

    return;
}

int compareTwoNum(string firstStr, string secondStr)
{
    int firstStrLen, secondStrLen;
    firstStrLen = firstStr.length();
    secondStrLen = secondStr.length();

    if (firstStrLen > secondStrLen) {
        return ;
    }
    else if (firstStrLen < secondStrLen) {
        return -;
    }
    else {
        for (int i = ; i < firstStrLen; i++) {
            if (string2num(&firstStr[i]) > string2num(&secondStr[i])) {
                return ;
            }
            else if (string2num(&firstStr[i]) < string2num(&secondStr[i])){
                return -;
            }
            else {
                continue;
            }
        }
    }

    return ;
}

int twoCharSub(char ch1, char ch2, bool &lessOne)
{
    //cout << ch1 << "  " << ch2 << "  " << lessOne << endl;

    int num1, num2;

    if (lessOne) {
        num1 = string2num(&ch1) - ;
    }
    else {
        num1 = string2num(&ch1);
    }

    num2 = string2num(&ch2);

    if (num1 >= num2) {
        lessOne = false;
        return num1 - num2;
    }
    else {
        lessOne = true;
        return  + num1 - num2;
    }
}

收获：

更加熟悉string等...