LeetCode907 子数组的最小值之和

public class Case907 {
    public static void main(String[] args) {
        int arr[] = {3,1,2,4};
        System.out.println(sumSubarrayMins(arr));
    }

    public static int sumSubarrayMins(int[] arr) {

        int res = 0;
        int i = 0;

        while (i < arr.length) {
            int j = arr.length-1;
              while (i <= j) {
               int sum = arr[j];
               int k = j;
                while (i <= k) {
                    sum = Math.min(sum, arr[k]);
                    k--;
                }
                res += sum;
                j--;
            }
              i++;
        }
        return res;
    }
}