LeetCode *** 166. Fraction to Recurring Decimal

题目:

Given two integers representing the numerator and denominator of a fraction, return the fraction in string format.

If the fractional part is repeating, enclose the repeating part in parentheses.

For example,

  • Given numerator = 1, denominator = 2, return "0.5".
  • Given numerator = 2, denominator = 1, return "2".
  • Given numerator = 2, denominator = 3, return "0.(6)".


分析:


代码:

class Solution {
public:
	string fractionToDecimal(int numerator, int denominator) {
		if (denominator == 0)return "";
		if (numerator == INT_MIN&&denominator == -1)return "2147483648";
		long long inte = numerator / denominator,deci = numerator % denominator,i=-1,pos;
		int sign = ((numerator > 0) ^ (denominator > 0)) ? -1 : 1;
		if (!deci)return to_string(inte);

		string t = "";
		map<long long, long long> mp;

		while (deci) {
			if (mp.find(deci) != mp.end()) {
				pos = mp[deci];
				break;
			}
			else mp[deci] = ++i;
			int	subinte = (deci * 10) / denominator;
			t += to_string(abs(subinte));
			deci = (deci * 10) % denominator;
		}
		if (deci) {
			t.insert(t.begin() + pos, '(');
			t.insert(t.end(), ')');
		}
		string tmp = to_string(abs(inte)) + ".";
		t.insert(t.begin(), tmp.begin(),tmp.end());
		if (sign == -1)t.insert(t.begin(), '-');
		return t;
	}
};


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

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

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

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值