Package g1101_1200.s1191_k_concatenation_maximum_sum

Class Solution

  • All Implemented Interfaces:
    
public final class Solution

    1191 - K-Concatenation Maximum Sum\.

    Medium

    Given an integer array arr and an integer k, modify the array by repeating it k times.

    For example, if arr = [1, 2] and k = 3 then the modified array will be [1, 2, 1, 2, 1, 2].

    Return the maximum sub-array sum in the modified array. Note that the length of the sub-array can be 0 and its sum in that case is 0.

    As the answer can be very large, return the answer modulo <code>10<sup>9</sup> + 7</code>.

    Example 1:

    Input: arr = 1,2, k = 3

    Output: 9

    Example 2:

    Input: arr = 1,-2,1, k = 5

    Output: 2

    Example 3:

    Input: arr = -1,-2, k = 7

    Output: 0

    Constraints:

    • <code>1 <= arr.length <= 10<sup>5</sup></code>

    • <code>1 <= k <= 10<sup>5</sup></code>

    • <code>-10<sup>4</sup><= arri<= 10<sup>4</sup></code>

    • Nested Class Summary

      Nested Classes 
      Modifier and Type Class Description

    • Field Summary

      Fields 
      Modifier and Type Field Description

    • Constructor Summary

      Constructors 
      Constructor Description
      Solution()

    • Enum Constant Summary

      Enum Constants 
      Enum Constant Description

    • Method Summary

      Modifier and Type Method Description
      final Integer kConcatenationMaxSum(IntArray arr, Integer k)

      • Methods inherited from class java.lang.Object

        clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait