LeetCode: 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) {
        map<int, int> m_map;
        string result = "";
        if((numerator > 0 && denominator < 0) || (numerator < 0 && denominator > 0))
            result += "-";
        long num = numerator;
        long deno = denominator;
        num = std::abs(num);
        deno = std::abs(deno);
        result += to_string(num/deno);
        long remain = num % deno;
        if(remain == 0)
            return result;
        result += ".";
        int index = 0;
        string cur = "";
        m_map[remain] = index++;
        while(remain != 0)
        {
            remain = remain*10;
            long div = remain / deno;
            remain = remain % deno;
            cur += to_string(div);
            if(m_map.find(remain) != m_map.end())
            {
                cur.insert(m_map[remain], "(");
                cur.insert(index+1, ")");
                result += cur;
                cur = "";
                break;
            }
            else
            {
                m_map[remain] = index;
            }
            index++;
        }
        if(cur != "")
            result += cur;
        return result;
    }
};

Round 2:

class Solution {
public:
    vector<vector<int> > combinationSum(vector<int> &candidates, int target) {
        vector<vector<int> > result;
		if(candidates.empty())
			return result;
		vector<int> cur;
		std::sort(candidates.begin(), candidates.end());
		int sum = 0;
		dfs(candidates, target, result, cur, sum, 0);
		return result;
    }
private:
	void dfs(vector<int> &candidates, int target, vector<vector<int> > &result, vector<int> &cur, int &sum, int index)
		{
			if(sum > target)
				return;
			if(sum == target)
			{
				result.push_back(cur);
				return;
			}
			for(int i = index; i < candidates.size(); i++)
			{
				if(i > 0 && candidates[i] == candidates[i-1])
					continue;
				if(sum + candidates[i] > target)
					break;
				cur.push_back(candidates[i]);
				sum += candidates[i];
				dfs(candidates, target, result, cur, sum, i);
				sum -= candidates[i];
				cur.pop_back();
			}
		}
};