3689. Maximum Total Subarray Value I Difficulty

class Solution {
    public long maxTotalValue(int[] nums, int k) {
        int min = Integer.MAX_VALUE;
        int max = Integer.MIN_VALUE;

        for (int num : nums) {
            min = Math.min(min, num);
            max = Math.max(max, num);
        }
        return 1L * (max - min) * k;
    }
}

class Solution:
    def maxTotalValue(self, nums, k):

        minimum = min(nums)
        maximum = max(nums)

        return (maximum - minimum) * k

class Solution {
public:
    long long maxTotalValue(vector<int>& nums, int k) {

        int minimum = INT_MAX;
        int maximum = INT_MIN;

        for (int num : nums) {
            minimum = min(minimum, num);
            maximum = max(maximum, num);
        }

        return 1LL * (maximum - minimum) * k;
    }
};

var maxTotalValue = function(nums, k) {

    let minimum = Infinity;
    let maximum = -Infinity;

    for (const num of nums) {
        minimum = Math.min(minimum, num);
        maximum = Math.max(maximum, num);
    }

    return (maximum - minimum) * k;
};