你正在使用一堆木板建造跳水板。有两种类型的木板,其中长度较短的木板长度为shorter,长度较长的木板长度为longer。你必须正好使用k块木板。编写一个方法,生成跳水板所有可能的长度。
返回的长度需要从小到大排列。
示例:
输入:
shorter = 1
longer = 2
k = 3
输出: {3,4,5,6}
提示:
0 < shorter <= longer
0 <= k <= 100000
来源:力扣(LeetCode)
链接:https://leetcode-cn.com/problems/diving-board-lcci
著作权归领扣网络所有。商业转载请联系官方授权,非商业转载请注明出处。
x + y = k; x * s + ( k - x ) * l = z,由这两个公式可以推出z = x * (s - l ) + k * l = z
public class Main {
public static void main(String[] args) {
// int a[][] = {{0,0,0},{0,1,0},{0,0,0}};
// int a[][] = {{1,0}};
System.out.println(divingBoard(2, 2, 0));
}
public static int[] divingBoard(int shorter, int longer, int k) {
if (k == 0) {
int ans[] = new int[0];
return ans;
} else if (shorter == longer){
int ans[] = new int[1];
ans[0] = k * shorter;
return ans;
} else {
int ans[] = new int[k+1];
for (int i=k; i>=0; i--) {
ans[i] = i * (shorter - longer) + k * longer;
}
Arrays.sort(ans);
return ans;
}
}
}
//dp,先将ans[0]中的跳板设为全为最短,然后每次换下短板上长板
public class Main {
public static void main(String[] args) {
// int a[][] = {{0,0,0},{0,1,0},{0,0,0}};
// int a[][] = {{1,0}};
System.out.println(divingBoard(1, 2, 3));
}
public static int[] divingBoard(int shorter, int longer, int k) {
if (k == 0) {
int ans[] = new int[0];
return ans;
} else if (shorter == longer){
int ans[] = new int[1];
ans[0] = k * shorter;
return ans;
} else {
int ans[] = new int[k+1];
ans[0] = shorter * k;
for (int i=1; i<=k; i++) {
ans[i] = ans[i-1] + longer - shorter;
}
return ans;
}
}
}