Backups/CS-Notes
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

auto commit

Browse Source
This commit is contained in:
CyC2018 2018-03-27 11:33:34 +08:00
parent ff2fce91e0
commit d67f608dc6
1 changed files with 12 additions and 12 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

24
notes/剑指 offer 题解.md
View File

@ -2272,25 +2272,25 @@ public ArrayList<Integer> FindNumbersWithSum(int[] array, int sum) {
```java ```java
public ArrayList<ArrayList<Integer>> FindContinuousSequence(int sum) { public ArrayList<ArrayList<Integer>> FindContinuousSequence(int sum) {
ArrayList<ArrayList<Integer>> ret = new ArrayList<>(); ArrayList<ArrayList<Integer>> ret = new ArrayList<>();
int start = 1, end = 2; int first = 1, last = 2;
int curSum = 3; int curSum = 3;
while (start <= sum / 2 && end < sum) { while (first <= sum / 2 && last < sum) {
if (curSum > sum) { if (curSum > sum) {
curSum -= start; curSum -= first;
start++; first++;
} else if (curSum < sum) { } else if (curSum < sum) {
end++; last++;
curSum += end; curSum += last;
} else { } else {
ArrayList<Integer> list = new ArrayList<>(); ArrayList<Integer> list = new ArrayList<>();
for (int i = start; i <= end; i++) { for (int i = first; i <= last; i++) {
list.add(i); list.add(i);
} }
ret.add(list); ret.add(list);
curSum -= start; curSum -= first;
start++; first++;
end++; last++;
curSum += end; curSum += last;
} }
} }
return ret; return ret;
@ -2447,7 +2447,7 @@ public double countProbability(int n, int s) {
flag = 1 - flag; flag = 1 - flag;
} }
int totalNum = (int) Math.pow(6, n); int totalNum = (int) Math.pow(6, n);
return (double) dp[n - 1][s - 1] / totalNum; return (double) dp[flag][s - 1] / totalNum;
} }
``` ```