Commit 7ade584

authored

Merge pull request youngyangyang04#855 from KailokFung/master

fix(0135): 加了注释,比原先少一次遍历

2 parents f6ed4c2 + cb9a717 commit 7ade584Copy full SHA for 7ade584

File tree

2 files changed

+18

-15

lines changed

problems
- 0135.分发糖果.md
- 0763.划分字母区间.md

2 files changed

+18

-15

lines changed

`‎problems/0135.分发糖果.md‎`

Lines changed: 15 additions & 12 deletions

Original file line number	Diff line number	Diff line change
`@@ -132,30 +132,33 @@ public:`
`132`	`132`	`Java:`
`133`	`133`	```java
`134`	`134`	`class Solution {`
	`135`	`+ /**`
	`136`	`+ 分两个阶段`
	`137`	`+ 1、起点下标1 从左往右,只要右边比左边大,右边的糖果=左边 + 1`
	`138`	`+ 2、起点下标 ratings.length - 2 从右往左, 只要左边比右边大,此时左边的糖果应该取本身的糖果数(符合比它左边大) 和右边糖果数 + 1 二者的最大值,这样才符合它比它左边的大,也比它右边大`
	`139`	`+ */`
`135`	`140`	`public int candy(int[] ratings) {`
`136`		`- int[] candy = new int[ratings.length];`
`137`		`- for (int i = 0; i < candy.length; i++) {`
`138`		`- candy[i] = 1;`
`139`		`- }`
`140`		`-`
	`141`	`+ int[] candyVec = new int[ratings.length];`
	`142`	`+ candyVec[0] = 1;`
`141`	`143`	`for (int i = 1; i < ratings.length; i++) {`
`142`	`144`	`if (ratings[i] > ratings[i - 1]) {`
`143`		`- candy[i] = candy[i - 1] + 1;`
	`145`	`+ candyVec[i] = candyVec[i - 1] + 1;`
	`146`	`+ } else {`
	`147`	`+ candyVec[i] = 1;`
`144`	`148`	`}`
`145`	`149`	`}`
`146`	`150`
`147`	`151`	`for (int i = ratings.length - 2; i >= 0; i--) {`
`148`	`152`	`if (ratings[i] > ratings[i + 1]) {`
`149`		`- candy[i] = Math.max(candy[i],candy[i + 1] + 1);`
	`153`	`+ candyVec[i] = Math.max(candyVec[i], candyVec[i + 1] + 1);`
`150`	`154`	`}`
`151`	`155`	`}`
`152`	`156`
`153`		`- int count = 0;`
`154`		`- for (int i = 0; i < candy.length; i++) {`
`155`		`- count += candy[i];`
	`157`	`+ int ans = 0;`
	`158`	`+ for (int s : candyVec) {`
	`159`	`+ ans += s;`
`156`	`160`	`}`
`157`		`-`
`158`		`- return count;`
	`161`	`+ return ans;`
`159`	`162`	`}`
`160`	`163`	`}`
`161`	`164`	```

`‎problems/0763.划分字母区间.md‎`

Lines changed: 3 additions & 3 deletions

Original file line number	Diff line number	Diff line change
`@@ -88,15 +88,15 @@ Java:`
`88`	`88`	`class Solution {`
`89`	`89`	`public List<Integer> partitionLabels(String S) {`
`90`	`90`	`List<Integer> list = new LinkedList<>();`
`91`		`- int[] edge = new int[123];`
	`91`	`+ int[] edge = new int[26];`
`92`	`92`	`char[] chars = S.toCharArray();`
`93`	`93`	`for (int i = 0; i < chars.length; i++) {`
`94`		`- edge[chars[i] - 0] = i;`
	`94`	`+ edge[chars[i] - 'a'] = i;`
`95`	`95`	`}`
`96`	`96`	`int idx = 0;`
`97`	`97`	`int last = -1;`
`98`	`98`	`for (int i = 0; i < chars.length; i++) {`
`99`		`- idx = Math.max(idx,edge[chars[i] - 0]);`
	`99`	`+ idx = Math.max(idx,edge[chars[i] - 'a']);`
`100`	`100`	`if (i == idx) {`
`101`	`101`	`list.add(i - last);`
`102`	`102`	`last = i;`

0 commit comments

Comments

(0)

Navigation Menu

Search code, repositories, users, issues, pull requests...

Provide feedback

Saved searches

Use saved searches to filter your results more quickly

Uh oh!

Commit 7ade584

File tree

2 files changed

2 files changed

`‎problems/0135.分发糖果.md‎`

`‎problems/0763.划分字母区间.md‎`

0 commit comments