2 problems

Author: hitzzc

README.md

@@ -206,6 +206,8 @@ Golang solution for leetcode. For each problem, there is a simple *_test.go to t
 #### [268. Missing Number](https://github.com/hitzzc/go-leetcode/tree/master/missing_number)
 #### [278. First Bad Version](https://github.com/hitzzc/go-leetcode/tree/master/missing_number)
 #### [279. Perfect Squares](https://github.com/hitzzc/go-leetcode/tree/master/perfect_squares)
+#### [282. Expression Add Operators](https://github.com/hitzzc/go-leetcode/tree/master/expression_add_operators)
+#### [283. Move Zeroes](https://github.com/hitzzc/go-leetcode/tree/master/expression_add_operators)
 
 
 

expression_add_operators/expression_add_operators.cpp

@@ -0,0 +1,39 @@
+class Solution {
+public:
+ vector<string> addOperators(string num, int target) {
+ vector<string> results;
+ DFS(num, target, 0, "", 0, " ", 0, results);
+ return results;
+ }
+
+ void DFS(string& num, int target, int idx, string solution, long long current_val, string pre_op, long long pre_val, vector<string>& results) {
+ if (current_val == target && idx == num.size()) {
+	results.push_back(solution);
+ return;
+	}
+ if (idx == num.size()) return;
+	string n;
+ long long v = 0;
+ for (int i = idx; i < num.size(); ++i) {
+ if (n =="0") {
+ return;
+	}
+	n += num[i];
+	v = 10*v + num[i] - '0';
+ if (solution.size() == 0) {
+ DFS(num, target, i+1, n, v, " ", 0, results);
+	}else {
+ DFS(num, target, i+1, solution + "+" + n, current_val + v, "+", v, results);
+ DFS(num, target, i+1, solution + "-" + n, current_val - v, "-", v, results);
+ if (pre_op == "+") {
+ DFS(num, target, i+1, solution + "*" + n, current_val-pre_val+pre_val*v, pre_op, pre_val*v, results);
+	}else if (pre_op == "-") {
+ DFS(num, target, i+1, solution + "*" + n, current_val+pre_val-pre_val*v, pre_op, pre_val*v, results);
+	}else {
+ DFS(num, target, i+1, solution + "*" + n, current_val*v, "*", v, results);
+	}
+	}
+	}
+ return;
+ }
+};

move_zeroes/move_zeroes.cpp

@@ -0,0 +1,16 @@
+class Solution {
+public:
+ void moveZeroes(vector<int>& nums) {
+ int j = 0;
+ int tmp;
+ for (int i = 0; i < nums.size(); ++i){
+ if (nums[i] != 0){
+	tmp = nums[i];
+	nums[i] = nums[j];
+	nums[j] = tmp;
+	j++;
+	}
+ }
+ return;
+ }
+};