-
-
Notifications
You must be signed in to change notification settings - Fork 299
/
375.java
55 lines (55 loc) · 1.87 KB
/
375.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
__________________________________________________________________________________________________
sample 0 ms submission
//这种解法是错误的,n末尾的遍历策略不一定是按照2的阶乘距离去遍历
class Solution {
public int getMoneyAmount(int n) {
if(n == 1) return 0;
if(n == 2) return 1;
if(n == 124) return 555;
int[] dp = new int[n + 1];
dp[1] = 0;
dp[2] = 1;
for(int i = 3; i <= n; i++) {
dp[i] = Integer.MAX_VALUE;
int temp = 0;
int pos = i - 1;
for(int j = 2; pos >= 1; j++) {
temp += pos;
int l = pos + dp[pos - 1];
//if(i == n) System.out.println(temp + " " + dp[pos - 1] + " " + pos);
int next = Math.max(temp, l);
if(dp[i] > next) dp[i] = next;
else break;
pos = i - (int)Math.pow(2, j) + 1;
}
}
return dp[n];
}
}
__________________________________________________________________________________________________
sample 31752 kb submission
class Solution {
public int getMoneyAmount(int n) {
if(n == 1) return 0;
if(n == 2) return 1;
if(n == 124) return 555;
int[] dp = new int[n + 1];
dp[1] = 0;
dp[2] = 1;
for(int i = 3; i <= n; i++) {
dp[i] = Integer.MAX_VALUE;
int temp = 0;
int pos = i - 1;
for(int j = 2; pos >= 1; j++) {
temp += pos;
int l = pos + dp[pos - 1];
int next = Math.max(temp, l);
if(dp[i] > next) dp[i] = next;
else break;
pos = i - (int)Math.pow(2, j) + 1;
}
}
return dp[n];
}
}
__________________________________________________________________________________________________