python-programs/array_python.py at master · kumaya/python-programs · 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
# 2D array in python
matix= [[xforxinxrange(5)] for_inxrange(5)]
printmatix[1][2]

print"*"*80
# Maximum subsequence of 0's in a binary number
bin_num=1000000011111010110001
bin_num=int(str(bin_num), 2)
printbin_num
maxLen=0
currLen=0
whilebin_num>0:
ifbin_num%2==1:
currLen=0
else:
currLen+=1
ifcurrLen>maxLen:
maxLen=currLen
bin_num=bin_num/2
printmaxLen

print"*"*80
# Maximum size square sub-matrix with all 1's
inp_mat= [[1, 1, 1, 0, 1],
 [1, 1, 0, 1, 0],
 [0, 1, 1, 1, 1],
 [1, 1, 1, 1, 1],
 [1, 1, 1, 1, 1],
 [1, 1, 1, 1, 1],
 [0, 0, 0, 0, 0]]
max_val=0
foriinxrange(len(inp_mat)):
forjinxrange(len(inp_mat[0])):
ifinp_mat[i][j] ==1:
inp_mat[i][j] =min(inp_mat[i][j-1], inp_mat[i-1][j], inp_mat[i-1][j-1]) +1
else:
inp_mat[i][j] =0
fori,jinenumerate(inp_mat):
fork, linenumerate(inp_mat[i]):
ifl>max_val:
max_val=l
print"Maximum size square is %d"%(max_val)