2

Author: hitzzc

README.md

@@ -252,6 +252,8 @@ Golang solution for leetcode. For each problem, there is a simple *_test.go to t
 #### [349. Intersection of Two Arrays](https://github.com/hitzzc/go-leetcode/tree/master/intersection_of_two_arrays)
 #### [350. Intersection of Two Arrays II](https://github.com/hitzzc/go-leetcode/tree/master/intersection_of_two_arrays_II)
 #### [354. Russian Doll Envelopes](https://github.com/hitzzc/go-leetcode/tree/master/russian_doll_envelopes)
+#### [367. Valid Perfect Square](https://github.com/hitzzc/go-leetcode/tree/master/valid_perfect_square)
+#### [368. Largest Divisible Subset](https://github.com/hitzzc/go-leetcode/tree/master/largest_divisible_subset)
 
 
 

largest_divisible_subset/largest_divisible_subset.cpp

@@ -0,0 +1,32 @@
+class Solution {
+public:
+    vector<int> largestDivisibleSubset(vector<int>& nums) {
+        if (nums.size() == 0) return {};
+    	sort(nums.begin(), nums.end());
+        vector<int> dp(nums.size(), 1), pre(nums.size());
+        for (int i = 0; i < pre.size(); ++i) {
+        	pre[i] = i;
+        }
+        int max_v = 1, k = 0;
+        for (int i = 1; i < dp.size(); ++i) {
+        	for (int j = i-1; j >= 0; --j) {
+        		if (nums[i] % nums[j] != 0) continue;
+        		if (dp[i] < dp[j]+1) {
+        			pre[i] = j;
+        			dp[i] = dp[j]+1;
+        		}
+        		if (dp[i] > max_v) {
+        			max_v = dp[i];
+        			k = i;
+        		}
+        	}
+        }
+        vector<int> result;
+        while (k != pre[k]) {
+        	result.push_back(nums[k]);
+        	k = pre[k];
+        }
+        result.push_back(nums[k]);
+        return result;
+    }
+};

valid_perfect_square/valid_perfect_square.cpp

@@ -0,0 +1,16 @@
+class Solution {
+public:
+    bool isPerfectSquare(int num) {
+        long i = 1, j = num;
+        while (i <= j) {
+        	long mid = i + (j-i)/2;
+        	if (mid*mid == num) return true;
+        	if (mid*mid < num) {
+        		i = mid + 1;
+        	}else {
+        		j = mid - 1;
+        	}
+        }
+        return false;
+    }
+};