algorithm/Python
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Python.git synced 2025-07-05 01:09:40 +08:00
Code Issues Packages Projects Releases Wiki Activity

Simplify code by dropping support for legacy Python (#1143)

Browse Source 
* Simplify code by dropping support for legacy Python

* sort() --> sorted()
This commit is contained in:
Christian Clauss
2019-08-19 15:37:49 +02:00
committed by GitHub
parent 32aa7ff081
commit 47a9ea2b0b
145 changed files with 367 additions and 976 deletions
Download Patch File Download Diff File Expand all files Collapse all files

31
strings/min_cost_string_conversion.py
View File

@ -1,10 +1,3 @@
from __future__ import print_function
try:
xrange #Python 2
except NameError:
xrange = range #Python 3
'''
Algorithm for calculating the most cost-efficient sequence for converting one string into another.
The only allowed operations are
@ -19,19 +12,19 @@ def compute_transform_tables(X, Y, cC, cR, cD, cI):
m = len(X)
n = len(Y)
costs = [[0 for _ in xrange(n+1)] for _ in xrange(m+1)]
ops = [[0 for _ in xrange(n+1)] for _ in xrange(m+1)]
costs = [[0 for _ in range(n+1)] for _ in range(m+1)]
ops = [[0 for _ in range(n+1)] for _ in range(m+1)]
for i in xrange(1, m+1):
for i in range(1, m+1):
costs[i][0] = i*cD
ops[i][0] = 'D%c' % X[i-1]
for i in xrange(1, n+1):
for i in range(1, n+1):
costs[0][i] = i*cI
ops[0][i] = 'I%c' % Y[i-1]
for i in xrange(1, m+1):
for j in xrange(1, n+1):
for i in range(1, m+1):
for j in range(1, n+1):
if X[i-1] == Y[j-1]:
costs[i][j] = costs[i-1][j-1] + cC
ops[i][j] = 'C%c' % X[i-1]
@ -77,7 +70,7 @@ if __name__ == '__main__':
string = list('Python')
i = 0
cost = 0
with open('min_cost.txt', 'w') as file:
for op in sequence:
print(''.join(string))
@ -86,7 +79,7 @@ if __name__ == '__main__':
file.write('%-16s' % 'Copy %c' % op[1])
file.write('\t\t\t' + ''.join(string))
file.write('\r\n')
cost -= 1
elif op[0] == 'R':
string[i] = op[2]
@ -94,7 +87,7 @@ if __name__ == '__main__':
file.write('%-16s' % ('Replace %c' % op[1] + ' with ' + str(op[2])))
file.write('\t\t' + ''.join(string))
file.write('\r\n')
cost += 1
elif op[0] == 'D':
string.pop(i)
@ -102,7 +95,7 @@ if __name__ == '__main__':
file.write('%-16s' % 'Delete %c' % op[1])
file.write('\t\t\t' + ''.join(string))
file.write('\r\n')
cost += 2
else:
string.insert(i, op[1])
@ -110,12 +103,12 @@ if __name__ == '__main__':
file.write('%-16s' % 'Insert %c' % op[1])
file.write('\t\t\t' + ''.join(string))
file.write('\r\n')
cost += 2
i += 1
print(''.join(string))
print('Cost: ', cost)
file.write('\r\nMinimum cost: ' + str(cost))