arrays

Author: IsaKons

Algorythms/ABSwithNegative.py

@@ -0,0 +1,11 @@
+#Лист содержит значения в 1-длинна листа. Нужно вывести недостающие для полгоно покрытия значений
+nums = [1, 2, 3, 3, 4, 5, 6, 7, 7]
+for n in nums:
+    print("#########")
+    print(nums)
+    a = abs(n) - 1
+    print(a)
+    if nums[a] > 0: nums[a] *= -1
+    print(nums[a])
+    print("**********")
+print([i+1 for i in range(len(nums)) if nums[i] > 0])

Algorythms/TwoPointers.py

@@ -0,0 +1,19 @@
+f, s, t = float('-inf'), float('-inf'), float('-inf')  
+# good think, use and compare in first loop. With None you cant do that
+# can be -> and <- or ->> and -> for pointers
+###################
+nums = [-9,5,6,34]
+
+l = len(nums)     
+empty = [[] for x in range(l)]
+max = l -1
+min = 0
+for x in range(l-1, -1, -1):
+    if nums[min] ** 2 > nums[max] ** 2:
+        empty[x] = nums[min] ** 2
+        min += 1
+    else:
+        empty[x] = nums[max] ** 2
+        max -= 1
+        
+###################

loops.py

@@ -5,8 +5,11 @@ def square_sum(numbers):
 for x in range(100, 10, -2):
     print("Number x = " + str(x))
 
-for x in range(1, 6):
+for x in range(6):
     print(x)
+    
+#len([ x for x in nums if len(str(x)) % 2 == 0])
+#for x in range(l-1, -1, -1): # В обратном порядке
 
 #WHILE####
 while True: