Question

(Same-number subsequence) Write an O(n) program in python that prompts the user to enter a sequence of integers and finds longest subsequence with the same number. Here is a sample run of the program:

<Output>
Enter a series of numbers ending with 0: 2 4 4 8 8 8 8 2 4 4 0
The longest same number sequence starts at index 3 with 4 values of 8
<End Output>

Answer 1

nums = []
n = -1
n = int(input("Enter a series of numbers ending with 0: "))
while n != 0:
nums.append(n)
n = int(input("Enter a series of numbers ending with 0: "))
count = 1
maxCount = 0
num = 0
index = 0
for i in range(0, len(nums)-1):
if nums[i] == nums[i+1]:
count = count + 1
else:
index = i
if maxCount < count:
maxCount = count
num = nums[i]
  
count = 1
  
print("The longest same number sequence starts at index "+str(index-maxCount)+" with "+str(maxCount)+" values of "+str(num));

Output:

sh-4.3$ python3 main.py Enter a series of numbers ending with : 2 Enter a series of numbers ending with 0: 4 Enter a series of numbers ending with 8: 4 Enter a series of numbers ending with 0: 8 Enter a series of numbers ending with 0: 8 Enter a series of numbers ending with 0: 8 Enter a series of numbers ending with 8: 8 Enter a series of numbers ending with 0: 2 Enter a series of numbers ending with : 4 Enter a series of numbers ending with 0: 4 Enter a series of numbers ending with θ: θ The longest same number sequence starts at index 3 with 4 values of 8