<commit_before><commit_msg>Create a skeleton for problem 166<commit_after>package leetcode;

/**
 * https://leetcode.com/problems/fraction-to-recurring-decimal/
 */
public class Problem166 {
    public String fractionToDecimal(int numerator, int denominator) {
        // TODO
        return "";
    }

    public static void main(String[] args) {
        Problem166 prob = new Problem166();
        System.out.println(prob.fractionToDecimal(1, 2)); // 0.5
        System.out.println(prob.fractionToDecimal(2, 1)); // 2
        System.out.println(prob.fractionToDecimal(2, 3)); // 0.(6)
    }
}
{'fraction_non_alphanumeric': 0.13804713804713806, 'fraction_numerical': 0.03872053872053872, 'mean_word_length': 2.966666666666667, 'pattern_counts': {'":': 0, '<': 3, '<?xml version=': 0, '>': 3, 'https://': 1, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
{'dir': 'git-commits-cleaned', 'id': '3615505', 'n_tokens_mistral': 203, 'n_tokens_neox': 179, 'n_words': 37}