findingsea's Studio.

Candy@LeetCode

LeetCode
Word count: 123 / Reading time: 1 min
2015/04/24 Share

Candy

双向爬坡。从左到右爬一边，再从右到左爬一边。再累加所有值即可。

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
public class Solution {
    public int candy(int[] ratings) {
        int[] candies = new int[ratings.length];
        int last = ratings.length - 1;
        int result = 0;
        for (int i = 1; i <= last; i++) {
            if (ratings[i - 1] < ratings[i]) {
                candies[i] = candies[i - 1] + 1;
            }
        }
        for (int i = last - 1; i >= 0; i--) {
            if (ratings[i] > ratings[i + 1]) {
                candies[i] = Math.max(candies[i], candies[i + 1] + 1);
            }
            result += candies[i];
        }
        result += ratings.length + candies[last];
        return result;
    }
}

原文作者: findingsea

原文链接: http://findingsea.github.io/2015/04/24/candy-at-leetcode/

发表日期: April 24th 2015, 9:47:00 am

版权声明: 本文采用知识共享署名-非商业性使用 4.0 国际许可协议进行许可

CATALOG
  1. 1. Candy
Total : 100
2020
2019
2018
2017
2015
2014
2013
Octopress GitHub Python Django 吐槽 Reading ACM 项目总结 JavaScript 日志 Java LeetCode Interview Algorithm Life Windows ffmpeg life Go c++ essay review