N-Gram (Map Reduce)

Give a number of strings and the number N. Use the Map Reduce method to count all N-Grams and their occurrences. The letter is granular.

Example

Example 1:

Input: N = 3
doc_1: "abcabc"
doc_2: "abcabc"
doc_3: "bbcabc"
Output:
[
  "abc": ５,
  "bbc": 1, 
  "bca": 3,
  "cab": 3
]

Example 2:

Input: N=3
doc_1: "abcabc"
Output:
[
  "abc": 2, 
  "bca": 1,
  "cab": 1
]

思路：注意最后的index是 abcabc , 0,1,2,3,4,5, n = 3, 最后一个其实点index是3，那么 str.length() - 3 = 3,  

那么 i < str.length() - n + 1

/**
 * Definition of OutputCollector:
 * class OutputCollector<K, V> {
 *     public void collect(K key, V value);
 *         // Adds a key/value pair to the output buffer
 * }
 */
public class NGram {

    public static class Map {
        public void map(String _, int n, String str,
                        OutputCollector<String, Integer> output) {
            // Write your code here
            // Output the results into output buffer.
            // Ps. output.collect(String key, Integer value);
            for(int i = 0; i < str.length() - n + 1; i++) {
                String substr = str.substring(i, i + n);
                output.collect(substr, 1);
            }
        }
    }

    public static class Reduce {
        public void reduce(String key, Iterator<Integer> values,
                           OutputCollector<String, Integer> output) {
            // Write your code here
            // Output the results into output buffer.
            // Ps. output.collect(String key, int value);
            int sum = 0;
            while(values.hasNext()) {
                sum += values.next();
            }
            output.collect(key, sum);
        }
    }
}