3689. Maximum Total Subarray Value I

/**
 * Problem: LeetCode 3689 - Maximum Total Subarray Value I
 * Difficulty: Medium
 * Language: Java
 * Author: CodeByTushu
 */
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;
    }
}

"""
Problem: LeetCode 3689 - Maximum Total Subarray Value I
Difficulty: Medium
Language: Python
Author: CodeByTushu
"""
from typing import List


class Solution:
    def maxTotalValue(self, nums: List[int], k: int) -> int:
        min_val = min(nums)
        max_val = max(nums)
        return (max_val - min_val) * k

/**
 * Problem: LeetCode 3689 - Maximum Total Subarray Value I
 * Difficulty: Medium
 * Language: C++
 * Author: CodeByTushu
 */
#include <vector>
#include <algorithm>

using namespace std;

/**
 * Problem: LeetCode 3689 - Maximum Total Subarray Value I
 * Difficulty: Medium
 * Language: C++
 * Author: CodeByTushu
 */
class Solution {
public:
    long long maxTotalValue(vector<int>& nums, int k) {
        int minVal = nums[0];
        int maxVal = nums[0];

        for (int num : nums) {
            minVal = min(minVal, num);
            maxVal = max(maxVal, num);
        }

        return 1LL * (maxVal - minVal) * k;
    }
};

/**
 * Problem: LeetCode 3689 - Maximum Total Subarray Value I
 * Difficulty: Medium
 * Language: JavaScript
 * Author: CodeByTushu
 */
var maxTotalValue = function(nums, k) {
    let min = nums[0];
    let max = nums[0];

    for (let i = 1; i < nums.length; i++) {
        if (nums[i] < min) min = nums[i];
        if (nums[i] > max) max = nums[i];
    }

    return (max - min) * k;
};