learn lists..

Author: IsaKons

Algorythms/CoutnBetween.py

@@ -0,0 +1,17 @@
+# Find shortest distance what contains sum of elems = target.
+target = 7
+nums = [2, 3, 1, 2, 4, 3]
+if len(nums) == 0:
+    resultant = 0
+start, end = 0, 0
+dist, summa = float("inf"), nums[0]
+while end <= len(nums) - 1:
+    if summa < target:
+        end += 1
+        if end <= len(nums) - 1:
+            summa += nums[end]
+    elif summa >= target:
+        dist = min(end - start + 1, dist)
+        summa -= nums[start]
+        start += 1
+resultant = dist if dist != float("inf") else 0

Sort/SortBuble.py

@@ -1,16 +1,15 @@
 #n^2 Сравнивает пары и менят местами и так по кругу
-oldlist = [10, 75, 43, 15, 25, -4, 27]
-
 def bubble_sort(mylist):
     last_item = len(mylist) - 1
     for z in range(0, last_item):
         for x in range(0, last_item-z):
             print(mylist)
             if mylist[x] > mylist[x+1]:
                 mylist[x], mylist[x+1] = mylist[x+1], mylist[x]
-
     return mylist
 
+
+oldlist = [10, 75, 43, 15, 25, -4, 27]
 print("Old List: ", oldlist)
 newlist = bubble_sort(oldlist).copy()
 print("New List: ", newlist)

Sort/SortMerge.py

@@ -1,33 +1,19 @@
 # Делит на кучу массивов затем собирая назад передвигает наименьшее в начало
 # принты для наглядности процесса
 def merge_sort(lst):
-    print(1)
-    print(lst)
     if len(lst) <= 1:
         return lst
     middle = len(lst) // 2
     left_list = lst[:middle]
-    print(2)
-    print(left_list)
     right_list = lst[middle:]
-    print(3)
-    print(right_list)
-    
+
     left_list = merge_sort(left_list)
     right_list = merge_sort(right_list)
-    print(4)
-    print(left_list)
-    print(5)
-    print(right_list)
 
     return list(merge(left_list, right_list))
 
 
 def merge(left_half, right_half):
-    print(6)
-    print(left_half)
-    print(7)
-    print(right_half)
     res = []
     while len(left_half) != 0 and len(right_half) != 0:
         if left_half[0] < right_half[0]:
@@ -40,8 +26,6 @@ def merge(left_half, right_half):
         res += right_half
     else:
         res += left_half
-    print(8)
-    print(res)
     return res
 
 

Sort/SortQuick.py

@@ -8,17 +8,7 @@ def quick_sort(lst):
 
 def quick_sort_helper(lst, low, high):
     if low < high:
-        print("#####")
-        print(lst)
-        print(low)
-        print(high)
-        print("#####")
         split_point = partition(lst, low, high)
-        print("*****")
-        print(lst)
-        print(low)
-        print(high)
-        print("*****")
         quick_sort_helper(lst, low, split_point - 1)
         quick_sort_helper(lst, split_point + 1, high)
 
@@ -28,25 +18,16 @@ def partition(lst, low, high):
     left_mark = low + 1
     right_mark = high
     done = False
-    print("begin")
-    print(lst)
-    print(right_mark)
     while not done:
         while left_mark <= right_mark and lst[left_mark] <= pivot_value:
             left_mark += 1
         while right_mark >= left_mark and lst[right_mark] >= pivot_value:
             right_mark -= 1
-
         if right_mark < left_mark:
             done = True
         else:
             lst[left_mark], lst[right_mark] = lst[right_mark], lst[left_mark]
-        print("inside")
-        print(lst)
     lst[low], lst[right_mark] = lst[right_mark], lst[low]
-    print("end")
-    print(lst)
-    print(right_mark)
     return right_mark
 
 

arrays.py

@@ -5,8 +5,10 @@
 NewCities = []
 
 mynumber_list = list(range(0, 10))      # Creates array 0-10
-visited = [ [] for _ in range(10)]      # Empty array create
+visited = [[] for _ in range(10)]      # Empty array create
 graph = {key: [] for key in range(10)}  # empty dickt create
+new_list = [[None for _ in range(x+1)] for x in range(numRows)]  # Creade empty 2d matrix
+l[x] = [0] * (i + 1)                    # Create llist inside list
 
 
 sys.argv                                # array of args provided
@@ -18,6 +20,7 @@
 cities.remove('Tula')                   # remove by name
 cities.reverse()                        # Reverse
 cities[::-1]                            # also reverse and can be done with STR!!
+cities[:] = cities[::-1]                # for cases when need to change inside function and also have change outside
 print(cities[-4:-1])                    # From -4 includet to -1 not includet
 cities.pop(1)                           # Delete and show deleted(can be saved in var)
 NewCities.append(cities.copy())         # Create a COPY of array

strings.py

@@ -41,4 +41,13 @@
 textlookfor = r"@\w+\.\w+"
 allresults = re.findall(textlookfor, mytext)
 
-print(allresults)
+print(allresults)
+
+# Get similar start
+strs = ["flower", "flow", "flight"]
+shortest = min(strs, key=len)
+for i, ch in enumerate(shortest):
+    for other in strs:
+        if other[i] != ch:
+            print(shortest[:i])
+print(shortest)