2

Author: hitzzc

README.md

@@ -254,6 +254,8 @@ Golang solution for leetcode. For each problem, there is a simple *_test.go to t
 #### [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)
+#### [371. Sum of Two Integers](https://github.com/hitzzc/go-leetcode/tree/master/sum_of_two_integers)
+#### [373. Find K Pairs with Smallest Sums](https://github.com/hitzzc/go-leetcode/tree/master/find_k_pairs_with_smallest_sums)
 
 
 

find_k_pairs_with_smallest_sums/find_k_pairs_with_smallest_sums.cpp

@@ -0,0 +1,27 @@
+class Solution {
+public:
+ vector<pair<int, int>> kSmallestPairs(vector<int>& nums1, vector<int>& nums2, int k) {
+ priority_queue<pair<int, int>, vector<pair<int, int>>, CMP> q;
+ vector<pair<int, int>> result;
+ for (int i = 0; i < min(k, (int)nums1.size()); ++i) {
+ for (int j = 0; j < min(k, (int)nums2.size()); ++j) {
+ auto node = make_pair(nums1[i], nums2[j]);
+ if (q.size() == k && node.first + node.second < q.top().first + q.top().second) {
+	q.pop();
+	}
+ if (q.size() < k) q.push(node);
+	}
+ }
+ while (!q.empty()) {
+	result.push_back(q.top());
+	q.pop();
+ }
+ return result;
+ }
+
+ struct CMP {
+bool operator () (const pair<int, int>& a, const pair<int, int>& b) {
+ return a.first + a.second < b.first + b.second;
+ }
+};
+};

sum_of_two_integers/sum_of_two_integers.cpp

@@ -0,0 +1,12 @@
+class Solution {
+public:
+ int getSum(int a, int b) {
+ int carry = 0;
+ while (b != 0) {
+	carry = a & b;
+	a ^= b;
+	b = carry << 1;
+ }
+ return a;
+ }
+};