Commit dc0bada

committed

update

1 parent 2365b49 commit dc0badaCopy full SHA for dc0bada

File tree

+34

-40

lines changed

+34

-40

lines changed

Lines changed: 0 additions & 39 deletions

This file was deleted.

Lines changed: 33 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,33 @@`
	`1`	`+package 其他.丢玻璃球;`
	`2`	`+`
	`3`	`+import java.util.Scanner;`
	`4`	`+`
	`5`	`+/**`
	`6`	`+ * F(N) = min{ max(1(碎了), F(N - 1) + 1(没碎)), max(2, F(N - 2) + 1), max(3, F(N - 3) + 1), ...... , max(N - 1, F(1))`
	`7`	`+ */`
	`8`	`+public class Solution {`
	`9`	`+ public static void main(String[] args) {`
	`10`	`+ int N = 0;`
	`11`	`+ Scanner scanner = new Scanner(System.in);`
	`12`	`+ while (N < 1) {`
	`13`	`+ N = scanner.nextInt();`
	`14`	`+ }`
	`15`	`+`
	`16`	`+ int[] dp = new int[N + 1];`
	`17`	`+ dp[0] = 0;`
	`18`	`+ dp[1] = 1;`
	`19`	`+`
	`20`	`+ for (int i = 2; i <= N; ++i) {`
	`21`	`+ int min = i;`
	`22`	`+ for (int j = 1; j < i; ++j) {`
	`23`	`+ int tmp = Math.max(j, dp[i - j] + 1);`
	`24`	`+ if (tmp < min) {`
	`25`	`+ min = tmp;`
	`26`	`+ }`
	`27`	`+ }`
	`28`	`+ dp[i] = min;`
	`29`	`+ }`
	`30`	`+`
	`31`	`+ System.out.println(dp[N]);`
	`32`	`+ }`
	`33`	`+}`

Lines changed: 1 addition & 1 deletion

Comments

(0)