Sync LeetCode submission Runtime - 0 ms (100.00%), Memory - 14.2 MB (79.63%)

Author: koralkulacoglu

LeetCode/1458-sort-integers-by-the-number-of-1-bits/README.md

@@ -0,0 +1,32 @@
+<p>You are given an integer array <code>arr</code>. Sort the integers in the array&nbsp;in ascending order by the number of <code>1</code>&#39;s&nbsp;in their binary representation and in case of two or more integers have the same number of <code>1</code>&#39;s you have to sort them in ascending order.</p>
+
+<p>Return <em>the array after sorting it</em>.</p>
+
+<p>&nbsp;</p>
+<p><strong class="example">Example 1:</strong></p>
+
+<pre>
+<strong>Input:</strong> arr = [0,1,2,3,4,5,6,7,8]
+<strong>Output:</strong> [0,1,2,4,8,3,5,6,7]
+<strong>Explantion:</strong> [0] is the only integer with 0 bits.
+[1,2,4,8] all have 1 bit.
+[3,5,6] have 2 bits.
+[7] has 3 bits.
+The sorted array by bits is [0,1,2,4,8,3,5,6,7]
+</pre>
+
+<p><strong class="example">Example 2:</strong></p>
+
+<pre>
+<strong>Input:</strong> arr = [1024,512,256,128,64,32,16,8,4,2,1]
+<strong>Output:</strong> [1,2,4,8,16,32,64,128,256,512,1024]
+<strong>Explantion:</strong> All integers have 1 bit in the binary representation, you should just sort them in ascending order.
+</pre>
+
+<p>&nbsp;</p>
+<p><strong>Constraints:</strong></p>
+
+<ul>
+	<li><code>1 &lt;= arr.length &lt;= 500</code></li>
+	<li><code>0 &lt;= arr[i] &lt;= 10<sup>4</sup></code></li>
+</ul>

LeetCode/1458-sort-integers-by-the-number-of-1-bits/solution.cpp

@@ -0,0 +1,13 @@
+class Solution {
+public:
+    vector<int> sortByBits(vector<int>& arr) {
+        sort(arr.begin(), arr.end(), [](int x, int y) {
+            int bx = __builtin_popcount(x);
+            int by = __builtin_popcount(y);
+            if (bx != by) return bx < by;
+            return x < y;
+        });
+        return arr;
+    }
+};
+