2

Author: hitzzc

Diff for: README.md

@@ -217,6 +217,9 @@ Golang solution for leetcode. For each problem, there is a simple *_test.go to t
 #### [299. Bulls and Cows](https://github.com/hitzzc/go-leetcode/tree/master/bulls_and_cows)
 #### [300. Longest Increasing Subsequence](https://github.com/hitzzc/go-leetcode/tree/master/longest_increasing_subsequence)
 #### [301. Remove Invalid Parentheses](https://github.com/hitzzc/go-leetcode/tree/master/remove_invalid_parentheses)
+#### [303. Range Sum Query - Immutable](https://github.com/hitzzc/go-leetcode/tree/master/range_sum_query_immutable)
+#### [304. Range Sum Query 2D - Immutable](https://github.com/hitzzc/go-leetcode/tree/master/range_sum_query_immutable)
+
 
 
 

Diff for: range_sum_query_2d_immutable/range_sum_query_2d_immutable.cpp

@@ -0,0 +1,21 @@
+#include <vector>
+using namespace std;
+
+class NumMatrix {
+	vector<vector<int>> records;
+public:
+    NumMatrix(vector<vector<int>> &matrix) {
+    	int row = matrix.size();
+    	int col = row == 0 ? 0 : matrix[0].size();
+        records = vector<vector<int>>(row+1, vector<int>(col+1, 0));
+        for (int i = 0; i < row; ++i) {
+        	for (int j = 0; j < col; ++j) {
+        		records[i+1][j+1] = records[i][j+1] + records[i+1][j] - records[i][j] + matrix[i][j];
+        	}
+        }
+    }
+
+    int sumRegion(int row1, int col1, int row2, int col2) {
+    	return records[row2+1][col2+1] - records[row2+1][col1] - records[row1][col2+1] + records[row1][col1];
+    }
+};

Diff for: range_sum_query_immutable/range_sum_query_immutable.cpp

@@ -0,0 +1,17 @@
+#include <vector>
+using namespace std;
+
+class NumArray {
+	vector<int> fn;
+public:
+    NumArray(vector<int> &nums): fn(vector<int>(nums.size()+1)) {
+        fn[0] = 0;
+        for (int i = 0; i < nums.size(); ++i) {
+        	fn[i+1] = fn[i] + nums[i];
+        }
+    }
+
+    int sumRange(int i, int j) {
+        return fn[j] - fn[i-1];
+    }
+};