Leetcode basecode all renamed

Author: geekprodev

src/app/common/tree_node.py

@@ -11,3 +11,4 @@ def __init__(self, val=0, left=None, right=None):
         self.val = val
         self.left = left
         self.right = right
+        self.next = None

src/app/leetcode/ltc_0004_median_of_two_sorted_arrays.py

@@ -0,0 +1,25 @@
+import sys
+
+"""
+Median of Two Sorted Arrays | https://leetcode.com/problems/median-of-two-sorted-arrays/
+"""
+class MedianOfTwoSortedArray:
+
+    def find_median_sorted_arrays(self, nums1, nums2):
+        ls1, ls2 = len(nums1), len(nums2)
+        if ls1 < ls2:
+            return self.find_median_sorted_arrays(nums2, nums1)
+        l, r = 0, ls2 * 2
+        while l <= r:
+            mid2 = (l + r) >> 1
+            mid1 = ls1 + ls2 - mid2
+            L1 = -sys.maxint - 1 if mid1 == 0 else nums1[(mid1 - 1) >> 1]
+            L2 = -sys.maxint - 1 if mid2 == 0 else nums2[(mid2 - 1) >> 1]
+            R1 = sys.maxint if mid1 == 2 * ls1 else nums1[mid1 >> 1]
+            R2 = sys.maxint if mid2 == 2 * ls2 else nums2[mid2 >> 1]
+            if L1 > R2:
+                l = mid2 + 1
+            elif L2 > R1:
+                r = mid2 - 1
+            else:
+                return (max(L1, L2) + min(R1, R2)) / 2.0

…c/app/leetcode/string_to_Integer_atoi.py …tcode/ltc_0008_string_to_Integer_atoi.pysrc/app/leetcode/string_to_Integer_atoi.py renamed to src/app/leetcode/ltc_0008_string_to_Integer_atoi.py src/app/leetcode/string_to_Integer_atoi.py renamed to src/app/leetcode/ltc_0008_string_to_Integer_atoi.py

@@ -1,5 +1,9 @@
-class Solution:
-    def myAtoi(self, str):
+"""
+String to Integer (atoi) | https://leetcode.com/problems/string-to-integer-atoi/
+"""
+class StringToIntegerAtoi:
+
+    def myAtoi(self, str: str) -> int:
         """
         :type str: str
         :rtype: int
@@ -24,20 +28,3 @@ def myAtoi(self, str):
             result = result * 10 + num
             pos += 1
         return sign * result
-
-    # def myAtoi(self, s):
-    #     #https://leetcode.com/discuss/83626/line-python-solution-eafp-instead-lbyl-easier-logic-beats-24%25
-    #     try:
-    #         s = s.lstrip() + '$' # remove leading spaces and append an end mark
-    #         for i, ch in enumerate(s):
-    #             if not (ch in '+-' or '0' <= ch <= '9'):
-    #                 result = int(s[:i])
-    #                 return -2 ** 31 if result < -2 ** 31 else 2 ** 31 - 1 if result > 2 ** 31 - 1 else result
-    #     except:
-    #         return 0
-
-"""
-s = Solution()
-print s.myAtoi("+-2")
-"""
-

…c/app/leetcode/merge_two_sorted_lists.py …tcode/ltc_0021_merge_two_sorted_lists.pysrc/app/leetcode/merge_two_sorted_lists.py renamed to src/app/leetcode/ltc_0021_merge_two_sorted_lists.py src/app/leetcode/merge_two_sorted_lists.py renamed to src/app/leetcode/ltc_0021_merge_two_sorted_lists.py

@@ -1,3 +1,5 @@
+from common.list_node import ListNode
+
 """
 Merge Two Sorted Lists | https://leetcode.com/problems/merge-two-sorted-lists/
 
@@ -7,9 +9,6 @@
 
 Return the head of the merged linked list.
 """
-
-from common.list_node import ListNode
-
 class MergeTwoSortedLists:
 
     def solution_one(self, l1, l2):

…app/leetcode/reverse_nodes_i_ k-group.py …ode/ltc_0025_reverse_nodes_i_ k-group.pysrc/app/leetcode/reverse_nodes_i_ k-group.py renamed to src/app/leetcode/ltc_0025_reverse_nodes_i_ k-group.py src/app/leetcode/reverse_nodes_i_ k-group.py renamed to src/app/leetcode/ltc_0025_reverse_nodes_i_ k-group.py

@@ -1,18 +1,11 @@
-# Definition for singly-linked list.
-# class ListNode
-#     def __init__(self, x):
-#         self.val = x
-#         self.next = None
+from app.common.list_node import ListNode
 
-# class Solution:
-#     def reverseKGroup(self, head, k):
-#         """
-#         :type head: ListNode
-#         :type k: int
-#         :rtype: ListNode
-#         """
-class Solution:
-    def reverseKGroup(self, head, k):
+"""
+Reverese Nodes in k-Group | https://leetcode.com/problems/reverse-nodes-in-k-group/
+"""
+class ReverseNodesInKGroup:
+
+    def reverse_k_group(self, head, k):
         if head is None:
             return None
         index = 0
@@ -25,13 +18,13 @@ def reverseKGroup(self, head, k):
         while pos is not None:
             if index % k == k - 1:
                 last = pos.next
-                start = self.reverseList(start, last)
+                start = self.reverse_list(start, last)
                 pos = start
             pos = pos.next
             index += 1
         return head.next
 
-    def reverseList(self, head, end):
+    def reverse_list(self, head, end):
         pos = head.next
         last = end
         next_start = pos

…e/remove_duplicates_from_sorted_array.py …6_remove_duplicates_from_sorted_array.pysrc/app/leetcode/remove_duplicates_from_sorted_array.py renamed to src/app/leetcode/ltc_0026_remove_duplicates_from_sorted_array.py src/app/leetcode/remove_duplicates_from_sorted_array.py renamed to src/app/leetcode/ltc_0026_remove_duplicates_from_sorted_array.py

@@ -1,3 +1,5 @@
+from ast import List
+
 """
 Remove Duplicates from Sorted Array | https://leetcode.com/problems/remove-duplicates-from-sorted-array/
 
@@ -10,10 +12,8 @@
 Do not allocate extra space for another array. You must do this by modifying the input array in-place with O(1) extra memory.
 
 """
-
-from ast import List
-
 class RemoveDuplicatesFromSortedArray:
+
     def solution_one(self, nums: List[int]) -> int:
         if len(nums) == 0:
             return 0

…tring_with_concatenation_of_all_words.py …tring_with_concatenation_of_all_words.pysrc/app/leetcode/substring_with_concatenation_of_all_words.py renamed to src/app/leetcode/ltc_0030_substring_with_concatenation_of_all_words.py src/app/leetcode/substring_with_concatenation_of_all_words.py renamed to src/app/leetcode/ltc_0030_substring_with_concatenation_of_all_words.py

@@ -1,5 +1,9 @@
-class Solution:
-    def findSubstring(self, s, words):
+"""
+Substring with Concatenation of All Words | httrps://leetcode.com/problems/substring-with-concatenation-of-all-words/
+"""
+class SubstringWithConcatenationOfAllWords:
+
+    def find_substring(self, s: str, words: list[str]) -> list[int]:
         """
         :type s: str
         :type words: List[str]
@@ -31,10 +35,3 @@ def findSubstring(self, s, words):
                 # all word in target dict
                 res.append(start)
         return res
-
-    # def findSubstring(self, s, words):
-    #     # https://leetcode.com/discuss/87745/3-line-python-solution-sorted-hash-112ms
-    #     wLen, wtLen, wSet, sortHash, sLen = len(words[0]), len(words[0]) * len(words), set(words), sorted(
-    #         [hash(w) for w in words]), len(s)
-    #     h = [hash(s[i:i + wLen]) if s[i:i + wLen] in wSet else None for i in range(sLen - wLen + 1)]
-    #     return [i for i in range(sLen - wtLen + 1) if h[i] and sorted(h[i: i + wtLen: wLen]) == sortHash]

src/app/leetcode/ltc_0031_next_permutation.py

@@ -0,0 +1,33 @@
+"""
+Next Permutation | https://leetcode.com/problems/next-permutation/
+"""
+class NextPermutation(object):
+
+    def find_next_permutation(self, nums):
+        """
+        :type nums: List[int]
+        :rtype: void Do not return anything, modify nums in-place instead.
+        """
+        ls = len(nums)
+        if ls <= 1:
+            return
+        pair = []
+        for i in range(ls):
+            for j in range(i + 1, ls):
+                # append ascending order pair
+                if nums[i] < nums[j]:
+                    pair.append([i,j])
+        pos = 0
+        if len(pair) > 0:
+            self.swap(nums, pair[-1][0], pair[-1][1])
+            pos = pair[-1][0] + 1
+        # sort from pos
+        for i in range(pos, ls):
+            for j in range(i + 1, ls):
+                if nums[i] > nums[j]:
+                    self.swap(nums, i, j)
+
+    def swap(self, nums: list[int], index1: int, index2: int):
+        if index1 == index2:
+            return
+        nums[index1], nums[index2] = nums[index2], nums[index1]

…etcode/search_in_rotated_sorted_array.py …c_0033_search_in_rotated_sorted_array.pysrc/app/leetcode/search_in_rotated_sorted_array.py renamed to src/app/leetcode/ltc_0033_search_in_rotated_sorted_array.py src/app/leetcode/search_in_rotated_sorted_array.py renamed to src/app/leetcode/ltc_0033_search_in_rotated_sorted_array.py

@@ -1,3 +1,6 @@
+"""
+Search in Rotated Sorted Array | https://leetcode.com/problems/search-in-rotated-sorted-array/
+"""
 class SearchInRotatedSortedArray:
 
     def search(self, nums: list[int], target: int) -> int:

src/app/leetcode/search_for_a_range.py …/leetcode/ltc_0034_search_for_a_range.pysrc/app/leetcode/search_for_a_range.py renamed to src/app/leetcode/ltc_0034_search_for_a_range.py src/app/leetcode/search_for_a_range.py renamed to src/app/leetcode/ltc_0034_search_for_a_range.py

@@ -1,5 +1,9 @@
-class Solution:
-    def searchRange(self, nums, target):
+"""
+Search for a Range | https://leetcode.com/problems/search-for-a-range/
+"""
+class SearchForARange:
+
+    def find_range(self, nums: list[int], target: int) -> list[int]:
         """
         :type nums: List[int]
         :type target: int
@@ -25,4 +29,4 @@ def searchRange(self, nums, target):
                             min = i
                         max = i
                 return [min, max]
-        return [-1, -1]
+        return [-1, -1]