1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17
| class Solution { public int[] divingBoard(int shorter, int longer, int k) { if (k == 0) { return new int[]{}; } if (shorter == longer) { return new int[]{shorter * k}; } int[] ans = new int[k + 1]; for (int i = 0; i <= k; i++) { ans[i] = (k - i) * shorter + i * longer; } return ans; } }
|