-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathsumatrix.py
63 lines (52 loc) · 1.39 KB
/
sumatrix.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
def matrixElementsSum(matrix):
column = len(matrix[0])
row = len(matrix)
for i in range(column):
for j in range(row):
if matrix[j][i] == 0:
m=j
while (m < row):
matrix[m][i]=0
m = m+1
for i in range(row):
print(matrix[i])
def allLongestStrings(inputArray):
arraylen = len(inputArray)
stringlen =[]
for i in range(arraylen):
stringlen.append(len(inputArray[i]))
index = max(stringlen)
stringlist = []
def isLucky(n):
listdigit = [int(i) for i in str(n)]
index = int(len(str(n))/2)
if (sum(listdigit[:index])==sum(listdigit[index:])):
return True
else:
return False
def sortByHeight(a):
newlist = []
for i in range(len(a)):
if a[i]!=-1:
newlist.append(a[i])
newlist.sort()
m = 0
for i in range(len(a)):
if a[i] !=-1:
a[i]= newlist[m]
m +=1
return a
def reverseParentheses(s):
indexend = 0
for i in range(len(s)):
if s[i] == "(":
indexstart = i
if s[i] == ")":
indexend = i
break
if indexend != 0:
new = s[indexstart+1:indexend][::-1]
m = s[:indexstart]+new+s[indexend+1:]
return reverseParentheses(m)
else :
return s