malsagov1 · May 30, 2021 16:14 · malsagov1 · May 30, 2021 · malsagov1 · May 30, 2021
diff --git a/PSET6 CS50 DNA easy solution b/PSET6 CS50 DNA easy solution
 import csv
 import sys

 def repeats(str, dna):
    maxim = []
    counter = 0
    i=0
    while i<len(dna):
        if dna[i:i+len(str)] == str:
            counter = counter + 1
            i = i + len (str)
            continue
        elif counter>0:
            maxim.append(counter)
            counter = 0
        i=i+1
  
    if not maxim:
        return 0
    else:
        return max(maxim)
        
 filename = sys.argv[1]
 str1 = []
 pas = 0;
 with open(filename) as file:
    reader = csv.reader(file)
    for each in reader:
        str1.append(each)
 file2 = sys.argv[2]
 with open (file2) as file:
    dna = file.read()
 collision = True
 for i in range (1, len(str1)):
    for j in range (1, len(str1[0])):
        if int(str1[i][j]) != repeats(str1[0][j], dna):
            collision =False
            break
        else:
            collision = True
                
    if collision ==True:
        print (str1[i][0])
        sys.exit(0)
 print ("No match")
	import csv
	import sys

	def repeats(str, dna):
	maxim = []
	counter = 0
	i=0
	while i<len(dna):
	if dna[i:i+len(str)] == str:
	counter = counter + 1
	i = i + len (str)
	continue
	elif counter>0:
	maxim.append(counter)
	counter = 0
	i=i+1

	if not maxim:
	return 0
	else:
	return max(maxim)

	filename = sys.argv[1]
	str1 = []
	pas = 0;
	with open(filename) as file:
	reader = csv.reader(file)
	for each in reader:
	str1.append(each)
	file2 = sys.argv[2]
	with open (file2) as file:
	dna = file.read()
	collision = True
	for i in range (1, len(str1)):
	for j in range (1, len(str1[0])):
	if int(str1[i][j]) != repeats(str1[0][j], dna):
	collision =False
	break
	else:
	collision = True

	if collision ==True:
	print (str1[i][0])
	sys.exit(0)
	print ("No match")