LeetCode--------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?

C/C++ (clang++ 3.3)

1

class Solution {

2

public:

3

    int candy(vector<int> &ratings) {

4

        int N = ratings.size();

5

        //dp[i]第i+1人分到糖块数

6

        //sum[i]前1+1人总共糖块数

7

        vector<int> dp(N, 0);

8

        vector<int> sum(N, 0);

9

        dp[0] = 1;sum[0] = 1;

10

        for (int i=1; i<N; i++){

11

            if (ratings[i]>ratings[i-1]){

12

                dp[i] = dp[i-1]+1;

13

                sum[i] = sum[i-1]+dp[i];

14

            }else if(ratings[i-1] == ratings[i] || dp[i-1]>1){//

15

                dp[i] = 1;

16

                sum[i] =sum[i-1]+dp[i];

17

            }else {

18

                int j;

19

                dp[i] = dp[i-1];

20

                for (j=i; j>0 && ratings[j-1]>ratings[j] && dp[j-1]<=dp[j]; j--){

21

                    dp[j-1]++;

22

                }

23

24

                for (int k=1; j < i; j++,k++){

25

                    sum[j] +=k;

26

                }

27

                sum[i] = sum[i-1]+dp[i];

28

            }

29

        }

30

        return sum[N-1];

31

    }

32

};

 附：左右扫描法

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

class Solution { public :      int candy(vector< int > &ratings) {          //题意：N个孩子站成一排，每个孩子分配一个分值。给这些孩子派发糖果，满足如下要求：          //每个孩子至少一个          //分值更高的孩子比他的相邻位的孩子获得更多的糖果          //求至少分发多少糖果？          int len=ratings.size();          if (len==1)  return 1;                    int sum=0;          vector< int > v(len,1); //初始将每个孩子的糖果数都设为1                    //从左向右扫描，保证一个方向上分数更大的糖果更多          for ( int i=1;i<len;i++){              if (ratings[i] > ratings[i-1])                  v[i]=v[i-1]+1;          }          //从右向左扫描，保证另一个方向上分数更大的糖果更多          for ( int i=len-2;i>=0;i--){              if (ratings[i] > ratings[i+1] && v[i] <= v[i+1])                  v[i]=v[i+1]+1;          }                    for ( int i=0;i<len;i++){              sum+=v[i];          }          return sum;      } };