[LeetCode]504. Base 7

题目描述

思路

本来想着用栈，后来发现字符串拼接就可以实现了

代码

#include <iostream>#include <string>using namespace std;class Solution {public:    string convertToBase7(int num) {        string res = "";        bool flag = false;        if (num == 0) {            return "0";        }        if (num < 0) {            flag = true;            num = abs(num);        }        while (num) {            res = to_string(num % 7) + res;            num /= 7;        }        if (flag)            res = "-" + res;        return res;    }};int main() {    Solution sol;    cout << sol.convertToBase7(-7) << endl;    system("pause");}