Base 7 Problem & Solution

Given an integer num, return a string of its base 7 representation.

See the base 7 problem on LeetCode.

C++ Solution

#pragma GCC optimize("Ofast")
#pragma GCC optimization("unroll-loops")

static const int _=[](){ios::sync_with_stdio(false);cin.tie(nullptr);cout.tie(nullptr);return 0;}();

class Solution {
public:
  string convertToBase7(int num) {
    int positive = abs(num);

    string result;
    while (positive > 0) {
      result += positive % 7 + '0';
      positive /= 7;
    }
    
    if (num < 0) {
      result += '-';
    } else if (num == 0) {
      result = "0";
    }

    reverse(result.begin(), result.end());
    
    return result;
  }
};

Are you looking for a job?