Question

Python Algorithm Coding

There are N paper with three letters written on each paper. Characters are 0 to 9 digits or *.You can create a continuous number by attaching the paper in a proper order. Print out the maximum number of digits sum of a sequence of numbers that can be made when N paper is given.

For example, suppose you have a piece of paper with a lettering as shown below.

3 45

In this case, the consecutive numbers of strings that can be created are as follows:  

12, 126, 12345, 123456, 345, 3456, 6

The largest number of these is 123456, so the answer is 21. (1+2+3+4+5+6)

[Constraint]

1. The number N of paper is not more than 1,000. (1 ≤ N ≤ 1,000)

[Input]

The first line of input gives the total number of test cases T.

From the next line, each test case is given, and the first row is given the number N of paper.

The next line is given three letters written on N paper.

[Output]

The results for test case T are taken "#T" and output the maximum value of the digit agreement among the single space and consecutive numbers.

(T refers to the number of the test case and starts at 1.)

sample input

2
4
*15
7**
402
**3
6
**1
7**
567
24*
8**
234

sample output

#1 19
#2 36

Answer 1

# read the testcases
testCases = int(input("enter test cases:"))
# function to find max end max start value
def findmax(k,maxValue):
   valueWithoutStar = k.replace("*","")
   valueWithoutStar = int(valueWithoutStar)
   if(maxValue<valueWithoutStar):
       return valueWithoutStar
   else:
       return maxValue
# loop through each test cases and find max available
for i in range(testCases):
   # variables declarations
   maxValue=""
   maxStartValue = 0
   maxEndValue = 0
   # read the no of paper
   papers = int(input("No of papers"))
   strList = list()
   # read the paper values and add it to the list
   for j in range(papers):
       strList.append(input("enter paper value"))
   # loop to find start and end max values
   for k in strList:
       if("*" in k):
           index = k.index("*")
           if(index==0):
               maxEndValue = findmax(k,maxEndValue)
           else:
               maxStartValue = findmax(k,maxStartValue)
   # taked own the remining list of values and add it to the max values
   for k in strList:
       if("*" not in k):
           maxValue+=str(k)
   # now append startmax and remaining values and end max values
   maxValue=str(maxStartValue)+maxValue+str(maxEndValue)
   # type convert each value to int value
   maxValue = [int(k) for k in maxValue]
   # find sum of all digits
   maxValue = sum(maxValue)
   # print each test case max value
   print("#",i+1," ",maxValue,sep="")

Command Prompt Users De1lDesktop>python papersum py nter test cases:2 o of papers4 nter paper value#15 nter paper value?* nter paper value402 nter paper value3 1 19 o of papers6 nter paper value*1 nter paper value?** nter paper value567 nter paper value24* nter paper value8** nter paper value234 2 34 Users De11Desktop>

Sve 1 S we ea Sive A xLSHec has given only one

( second 术R T6孑 2ut 2.3 니 6+ +2+3+4t24 y 1 36322424 (nat 76) SIveA wyas 36 10 queston