1191K-ConcatenationMaximumSumK次串联后最大子数组之和Description:Givenanintegerarrayarrandanintegerk,modifythearraybyrepeatingitktimes.Forexample,ifarr=[1,2]andk=3thenthemodifiedarraywillbe[1,2,1,2,1,2].Returnthemaximumsub-arraysuminthemodifiedarray.Notethatthelengthofthesub-arraycanbe0anditssuminthatcaseis0.As