From 4bdc65d2aa097f02138411ad8d3ecd19a9228a9a Mon Sep 17 00:00:00 2001 From: Anshul Gupta Date: Mon, 6 Jul 2020 14:08:23 +0530 Subject: [PATCH 1/5] Create _461.cpp --- cpp/_461.cpp | 9 +++++++++ 1 file changed, 9 insertions(+) create mode 100644 cpp/_461.cpp diff --git a/cpp/_461.cpp b/cpp/_461.cpp new file mode 100644 index 0000000000..9e3fa32485 --- /dev/null +++ b/cpp/_461.cpp @@ -0,0 +1,9 @@ +// Hamming Distance + +class Solution { +public: + int hammingDistance(int x, int y) { + int c = x^y; + return __builtin_popcount(c); + } +}; From 763fd341f541330a0036b8f853bf77052e279239 Mon Sep 17 00:00:00 2001 From: Anshul Gupta Date: Mon, 6 Jul 2020 14:09:19 +0530 Subject: [PATCH 2/5] refactor 461 --- README.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/README.md b/README.md index ee51be5b4b..c33a0294ec 100644 --- a/README.md +++ b/README.md @@ -543,7 +543,7 @@ _If you like this project, please leave me a star._ ★ |464|[Can I Win](https://leetcode.com/problems/can-i-win/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_464.java)| |Medium| DP |463|[Island Perimeter](https://leetcode.com/problems/island-perimeter/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_463.java)| |Easy| |462|[Minimum Moves to Equal Array Elements II](https://leetcode.com/problems/minimum-moves-to-equal-array-elements-ii/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_462.java) || Medium| -|461|[Hamming Distance](https://leetcode.com/problems/hamming-distance/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_461.java) | |Easy| +|461|[Hamming Distance](https://leetcode.com/problems/hamming-distance/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_461.java), [C++](../master/cpp/_461.cpp) | |Easy| |460|[LFU Cache](https://leetcode.com/problems/lfu-cache/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_460.java) | | Hard| Design, LinkedHashMap, HashMap |459|[Repeated Substring Pattern](https://leetcode.com/problems/repeated-substring-pattern/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_459.java)| |Easy| String, KMP |458|[Poor Pigs](https://leetcode.com/problems/poor-pigs/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_458.java) | |Easy| Math From af9e328526b61fa15ba684f73d2f3312b0dbdd86 Mon Sep 17 00:00:00 2001 From: Anshul Gupta Date: Thu, 16 Jul 2020 23:34:16 +0530 Subject: [PATCH 3/5] Create _15.cpp --- cpp/_15.cpp | 40 ++++++++++++++++++++++++++++++++++++++++ 1 file changed, 40 insertions(+) create mode 100644 cpp/_15.cpp diff --git a/cpp/_15.cpp b/cpp/_15.cpp new file mode 100644 index 0000000000..55931921bf --- /dev/null +++ b/cpp/_15.cpp @@ -0,0 +1,40 @@ +class Solution { +public: + vector> threeSum(vector& nums) { + sort(nums.begin(),nums.end()); + + vector> v; + + if(nums.size()<3){ + //if vector nums has less than 3 elements, impossible to distribute into 3 element set -> return 0. + return v; + } + + for(int i=0;i0 and nums[i]==nums[i-1]){ + //same elements dont have to be taken. + continue; + } + + int l = i+1, r = nums.size()-1; + //Using 2-pointer concept + while(l0){ + r--; + }else if(sum<0){ + l++; + }else{ + v.push_back(vector {nums[i],nums[l],nums[r]}); + while(l Date: Thu, 16 Jul 2020 23:35:04 +0530 Subject: [PATCH 4/5] Create _4.cpp --- cpp/_4.cpp | 18 ++++++++++++++++++ 1 file changed, 18 insertions(+) create mode 100644 cpp/_4.cpp diff --git a/cpp/_4.cpp b/cpp/_4.cpp new file mode 100644 index 0000000000..803268c9fb --- /dev/null +++ b/cpp/_4.cpp @@ -0,0 +1,18 @@ +class Solution { +public: + double findMedianSortedArrays(vector& nums1, vector& nums2) { + //for adding second vector to last of first vector + nums1.insert(nums1.end(),nums2.begin(),nums2.end()); + sort(nums1.begin(),nums1.end()); + + int size = nums1.size(); + float sum = nums1[size/2]; + + if(size%2==0){ + sum += nums1[(size/2)-1]; + sum/=2; + } + + return (float)(sum); + } +}; From b0fa805c8bdce5780d506e1ab920c88a9e3a7c28 Mon Sep 17 00:00:00 2001 From: Anshul Gupta Date: Thu, 16 Jul 2020 23:38:22 +0530 Subject: [PATCH 5/5] Update README.md added c++ solution for 4 and 15 --- README.md | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) diff --git a/README.md b/README.md index c33a0294ec..b7b215fc13 100644 --- a/README.md +++ b/README.md @@ -965,7 +965,7 @@ _If you like this project, please leave me a star._ ★ |18|[4 Sum](https://leetcode.com/problems/4sum/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_18.java)||Medium|Two Pointers |17|[Letter Combinations of a Phone Number](https://leetcode.com/problems/letter-combinations-of-a-phone-number/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_17.java)||Medium|Backtracking |16|[3Sum Closest](https://leetcode.com/problems/3sum-closest/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_16.java)||Medium|Two Pointers -|15|[3Sum](https://leetcode.com/problems/3sum/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_15.java)|[:tv:](https://www.youtube.com/watch?v=jeim_j8VdiM)|Medium|Two Pointers, Binary Search +|15|[3Sum](https://leetcode.com/problems/3sum/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_15.java), [C++](../master/cpp/_15.cpp)|[:tv:](https://www.youtube.com/watch?v=jeim_j8VdiM)|Medium|Two Pointers, Binary Search |14|[Longest Common Prefix](https://leetcode.com/problems/longest-common-prefix/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_14.java)| [:tv:](https://www.youtube.com/watch?v=K1ps6d7YCy4)| Easy |13|[Roman to Integer](https://leetcode.com/problems/roman-to-integer)|[Solution](../master/src/main/java/com/fishercoder/solutions/_13.java)| |Easy | Math, String |12|[Integer to Roman](https://leetcode.com/problems/integer-to-roman/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_12.java)||Medium| Math, String @@ -976,7 +976,7 @@ _If you like this project, please leave me a star._ ★ |7|[Reverse Integer](https://leetcode.com/problems/reverse-integer/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_7.java) | [:tv:](https://youtu.be/tm1Yrb_SfBM) |Easy | |6|[ZigZag Conversion](https://leetcode.com/problems/zigzag-conversion/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_6.java) | |Easy | |5|[Longest Palindromic Substring](https://leetcode.com/problems/longest-palindromic-substring/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_5.java) | |Medium| -|4|[Median of Two Sorted Arrays](https://leetcode.com/problems/median-of-two-sorted-arrays/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_4.java) | |Hard | Divide and Conquer +|4|[Median of Two Sorted Arrays](https://leetcode.com/problems/median-of-two-sorted-arrays/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_4.java), [C++](../master/cpp/_4.cpp) | |Hard | Divide and Conquer |3|[Longest Substring Without Repeating Characters](https://leetcode.com/problems/longest-substring-without-repeating-characters/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_3.java) | |Medium | HashMap, Sliding Window |2|[Add Two Numbers](https://leetcode.com/problems/add-two-numbers/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_2.java) | |Medium | LinkedList |1|[Two Sum](https://leetcode.com/problems/two-sum/)|[Java](../master/src/main/java/com/fishercoder/solutions/_1.java), [C++](../master/cpp/_1.cpp)|[:tv:](https://www.youtube.com/watch?v=kPXOr6pW8KM&t=)|Easy| HashMap