LeetCode-with-Python/TwoSum_Lists.py at main · AdrianMunene/LeetCode-with-Python · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
#Attempt 1 at LeetCode Two Sums Challenge with time complexity O(n)
#Only works when the numbers are next to each other in the list
"""class Solution(object):
    def twoSum(self, nums, target):

        matchlst = []
        n=1
        for i in range(len(nums)):
            if nums[i] + nums[n] == target:
                matchlst [0:1] = i , n
            else:
                n+=1

        return matchlst[0:2]

target = 6
nums = [3,2]
matchlst = []
n = 1
for i in range(len(nums)):
    if nums[i] + nums[n] == target:
        matchlst [0:1] = i, n
        break
    else:
        n+=1

print(str(matchlst[0:2]))
"""
#Attempt 2 at LeetCode Challenge. Time Complexity O(n)
"""
target = 6
nums = [3,2,3]
matchlst = []
diff = 0
n = 0
for i in range(len(nums)*len(nums)):
    if i % len(nums) == 0:
        n = 0
    else:
        n+=1
"""
#Attempt 3 Uisng Modulus Succesfully
def is_array_sorted(arr):
  for i in range(len(arr)):
    if arr[i] <= arr[i-1] or arr[i] <= arr[(i+1) % len(arr)]:
      return False
  return True

arr = [1, 2, 3, 4, 5]
print(is_array_sorted(arr)) # True
arr = [1, 3, 2, 4, 5]
print(is_array_sorted(arr)) # False
"""
def is_array_sorted(arr):
  for i in range(len(arr)):
    if arr[i] <= arr[i % len(arr)]:
      return False
  return True

arr = [1, 2, 3, 4, 5]
print(is_array_sorted(arr)) # True
arr =
"""