zoukankan      html  css  js  c++  java
  • [leetcode]Candy @ Python

    原题地址:https://oj.leetcode.com/problems/candy/

    题意:

    There are N children standing in a line. Each child is assigned a rating value.

    You are giving candies to these children subjected to the following requirements:

    • Each child must have at least one candy.
    • Children with a higher rating get more candies than their neighbors.

    What is the minimum candies you must give?

    解题思路:求最少的蛋糕数。先从前到后扫描一遍数组,如果序列递增,就+1;然后从后到前扫描一遍数组,序列递增,+1。保证最低谷(ratings最小)永远是1就可以了。

    代码:

    class Solution:
        # @param ratings, a list of integer
        # @return an integer
        def candy(self, ratings):
            candynum = [1 for i in range(len(ratings))]
            for i in range(1, len(ratings)):
                if ratings[i] > ratings[i-1]:
                    candynum[i] = candynum[i-1] + 1
            for i in range(len(ratings)-2, -1, -1):
                if ratings[i+1] < ratings[i] and candynum[i+1] >= candynum[i]:
                    candynum[i] = candynum[i+1] + 1
            return sum(candynum)
  • 相关阅读:
    ZOJ 3529
    将博客搬至CSDN
    BST 增删查操作 递归/非递归实现
    容器vector容量翻倍增长策略效率分析
    整数分解为若干项之和
    PAT-B-1080 MOOC期终成绩
    最大公约数 + 最小公倍数
    Fibonacci数
    排序
    PAT-B-1020
  • 原文地址:https://www.cnblogs.com/zuoyuan/p/3760890.html
Copyright © 2011-2022 走看看