LeetCode 166. Fraction to Recurring Decimal

So, the best solution I have seen. 点击打开链接

Integer part is easy to handle. For the fraction part, we need to remember where the loop start. Thus, we need to remember the position to insert '(' and the remainder.

#include <string>
#include <unordered_map>
#include <iostream>
using namespace std;

string getDec(long remainder, long den) {
  string res = "";
  unordered_map<long, int> map;
  int i = 0;
  while((remainder != 0) && (map.find(remainder) == map.end())) {
    map.insert(make_pair(remainder, i));
    i++;
    remainder = remainder * 10;
    res = res + (to_string(remainder/den));
    remainder = remainder % den;
  }
  if(remainder != 0) {
    int pos = map[remainder];
    res.insert(pos, 1, '('); // insert position, bytes, char
    res = res + ")";
  }
  return res;
}

string fractionToDecimal(int numerator, int demoinator) {
  long num = numerator;
  long den = demoinator;

  bool neg = num * den < 0;
  num = abs(num);
  den = abs(den);

  string res = neg ? ("-" + to_string(num / den)) : to_string(num / den);
  long remainder = num % den;

  return (remainder == 0) ? res : (res + "." + getDec(remainder, den));
}

int main(void) {
  cout << fractionToDecimal(4, 333) << endl;
}


  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值