import numpy as np
def cityblock_distance(A, B):
result = np.sum([abs(a - b) for (a, b) in zip(A, B)])
return result
if __name__== "__main__":
arr1 = [5,2]
arr2 = [1,5]
result = cityblock_distance(arr1, arr2)
print(result)
Solve Problems by Coding Solutions - A Complete solution for python programming
import numpy as np
def cityblock_distance(A, B):
result = np.sum([abs(a - b) for (a, b) in zip(A, B)])
return result
if __name__== "__main__":
arr1 = [5,2]
arr2 = [1,5]
result = cityblock_distance(arr1, arr2)
print(result)
Using square() and sum()
import numpy as np
point1 = np.array((5,2))
point2 = np.array((1,5))
sum_sq = np.sum(np.square(point1 - point2))
print(np.sqrt(sum_sq))
NO_OF_CHARS = 256
def getNextState(pat, M, state, x):
if state < M and x == ord(pat[state]):
return state+1
i=0
for ns in range(state,0,-1):
if ord(pat[ns-1]) == x:
while(i<ns-1):
if pat[i] != pat[state-ns+1+i]:
break
i+=1
if i == ns-1:
return ns
return 0
def computeTF(pat, M):
global NO_OF_CHARS
TF = [[0 for i in range(NO_OF_CHARS)]\
for _ in range(M+1)]
for state in range(M+1):
for x in range(NO_OF_CHARS):
z = getNextState(pat, M, state, x)
TF[state][x] = z
return TF
def search(pat, txt):
global NO_OF_CHARS
M = len(pat)
N = len(txt)
TF = computeTF(pat, M)
state=0
for i in range(N):
state = TF[state][ord(txt[i])]
if state == M:
print("Pattern found at index: {}".\
format(i-M+1))
def main():
txt = "AABAACAADAABAAABAA"
pat = "AABA"
search(pat, txt)
if __name__ == '__main__':
main()
Bengaluru, Karnataka
New Delhi, India
Gurgaon, Haryana
Hyderabad, Telangana
Pune, Maharashtra
Chennai, Tamil Nadu
Noida, Uttar Pradesh
Mumbai, Maharashtra
Kolkata, West Bengal
Lucknow, Uttar Pradesh
import random
def printArray(stream,n):
for i in range(n):
print(stream[i],end=" ");
print();
def selectKItems(stream, n, k):
i=0;
reservoir = [0]*k;
for i in range(k):
reservoir[i] = stream[i];
while(i < n):
j = random.randrange(i+1);
if(j < k):
reservoir[j] = stream[i];
i+=1;
print("Following are k randomly selected items");
printArray(reservoir, k);
if __name__ == "__main__":
stream = [1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12];
n = len(stream);
k = 5;
selectKItems(stream, n, k);
def lower(matrix, row, col):
for i in range(0, row):
for j in range(0, col):
if (i < j):
print("0", end = " ");
else:
print(matrix[i][j],
end = " " );
print(" ");
def upper(matrix, row, col):
for i in range(0, row):
for j in range(0, col):
if (i > j):
print("0", end = " ");
else:
print(matrix[i][j],
end = " " );
print(" ");
matrix = [[1, 2, 3],
[4, 5, 6],
[7, 8, 9]];
row = 3;
col = 3;
print("Lower triangular matrix: ");
lower(matrix, row, col);
print("Upper triangular matrix: ");
upper(matrix, row, col);
def maxSum(arr):
arrSum = 0
currVal = 0
n = len(arr)
for i in range(0, n):
arrSum = arrSum + arr[i]
currVal = currVal + (i*arr[i])
maxVal = currVal
for j in range(1, n):
currVal = currVal + arrSum-n*arr[n-j]
if currVal > maxVal:
maxVal = currVal
return maxVal
if __name__ == '__main__':
arr = [10, 1, 2, 3, 4, 5, 6, 7, 8, 9]
print ("Max sum is: ", maxSum(arr))