feat: init k closest points to origin

Author: bujosa

alternative/easy/last_stone_weight.py

@@ -2,15 +2,15 @@
 import heapq
 
 def lastStoneWeight(stones: List[int]) -> int:
-    maxHeap = []
-    for stone in stones:
-        heapq.heappush(maxHeap, -stone)
-    while len(maxHeap) > 1:
-        stone1 = -heapq.heappop(maxHeap)
-        stone2 = -heapq.heappop(maxHeap)
+    stones = [-stone for stone in stones]
+    heapq.heapify(stones)
+    while len(stones) > 1:
+        stone1 = heapq.heappop(stones)
+        stone2 = heapq.heappop(stones)
         if stone1 != stone2:
-            heapq.heappush(maxHeap, -(stone1 - stone2))
-    return -maxHeap[0] if maxHeap else 0
+            heapq.heappush(stones, stone1 - stone2)
+
+    return -stones[0] if stones else 0
 
 assert lastStoneWeight([2,7,4,1,8,1]) == 1
 

src/medium/k_closest_points_to_origin.rs

@@ -17,6 +17,7 @@ pub mod find_the_duplicate_number;
 pub mod generate_parentheses;
 pub mod group_anagrams;
 pub mod implement_trie_prefix_tree;
+pub mod k_closest_points_to_origin;
 pub mod koko_eating_bananas;
 pub mod kth_smallest_element_in_a_bst;
 pub mod letter_combinations_of_a_phone_number;
@@ -37,7 +38,6 @@ pub mod subsets;
 pub mod subsets_ii;
 pub mod three_sum;
 pub mod three_sum_closest;
-
 pub mod time_based_key_value_store;
 pub mod top_k_frequent_elements;
 pub mod two_sum_ii_input_array_is_sorted;