-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathsessionWithHasan.py
205 lines (162 loc) · 3.55 KB
/
sessionWithHasan.py
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
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
<<<<<<< HEAD
"""
Write a function that takes a list as an argument,
iterate over all the numbers in list:
take sum, return sum
"""
def _sum(_input):
x = 0
for i in range(len(_input)):
x += _input[i]
return x
# print(_sum([1,2,3,4,5]))
"""
Write a function nmaed 'isEven' that takes a int as input,
check if the int is even, then return True
if it is odd, then return False
"""
def isEven(n):
if(n % 2 == 0):
return True
return False
# print(isEven(12))
def isOdd(n):
return not isEven(n)
"""
Take the sum of a list, but only where the indicies are even.
Call it evenSum([])
"""
def evenSum(_list):
x = 0
for i in range(len(_list)):
if isEven(i):
x += _list[i]
return x
# print(evenSum([1,2,3,4,5]))
"""
Given a string, count the number of chars in that string,
and put that into a dictionary.
"""
def countChars(aStr):
_dict = {}
for val in aStr:
if (val in _dict):
_dict[val] += 1
else:
_dict[val] = 1
return _dict
# print(countChars('HASAAN'))
# print({'H':1, 'A':3, 'S':1, 'N':1})
def reverse(_list):
return _list[::-1]
def flip(param, aMatrix):
temp = aMatrix
if (param == 'V'):
for i in range(len(temp)):
temp[i] = reverse(temp[i])
elif (param == 'H'):
temp = reverse(temp)
return temp
def main(aSequence, aMatrix):
curMatrix = aMatrix
for subSequence in aSequence:
curMatrix = flip(subSequence, curMatrix)
return curMatrix
# print(main('VH', [[1,2],[3,4]]))
def reverse(arr):
def swap(i, j):
tmp = arr[i]
arr[i] = arr[j]
arr[j] = tmp
i = 0
j = len(arr)-1
while (i <= j):
swap(i,j)
i+=1
j-=1
return arr
print(reverse([1,2,3,4]))
=======
"""
Write a function that takes a list as an argument,
iterate over all the numbers in list:
take sum, return sum
"""
def _sum(_input):
x = 0
for i in range(len(_input)):
x += _input[i]
return x
# print(_sum([1,2,3,4,5]))
"""
Write a function nmaed 'isEven' that takes a int as input,
check if the int is even, then return True
if it is odd, then return False
"""
def isEven(n):
if(n % 2 == 0):
return True
return False
# print(isEven(12))
def isOdd(n):
return not isEven(n)
"""
Take the sum of a list, but only where the indicies are even.
Call it evenSum([])
"""
def evenSum(_list):
x = 0
for i in range(len(_list)):
if isEven(i):
x += _list[i]
return x
# print(evenSum([1,2,3,4,5]))
"""
Given a string, count the number of chars in that string,
and put that into a dictionary.
"""
def countChars(aStr):
_dict = {}
for val in aStr:
if (val in _dict):
_dict[val] += 1
else:
_dict[val] = 1
return _dict
# print(countChars('HASAAN'))
# print({'H':1, 'A':3, 'S':1, 'N':1})
def reverse(_list):
return _list[::-1]
def flip(param, aMatrix):
temp = aMatrix
if (param == 'V'):
for i in range(len(temp)):
temp[i] = reverse(temp[i])
elif (param == 'H'):
temp = reverse(temp)
return temp
def main(aSequence, aMatrix):
curMatrix = aMatrix
for subSequence in aSequence:
curMatrix = flip(subSequence, curMatrix)
return curMatrix
# print(main('VH', [[1,2],[3,4]]))
def reverse(arr):
def swap(i, j):
tmp = arr[i]
arr[i] = arr[j]
arr[j] = tmp
i = 0
j = len(arr)-1
while (i <= j):
swap(i,j)
i+=1
j-=1
return arr
reversed = []
def reverse2(arr):
for elem in arr:
reversed.insert(0, elem)
return reversed
print(reverse2([1,2,3,4]))
>>>>>>> c87048f6d203a6448ef863b636a9fca7537a1dee