[leetcode]135 分发糖果

Candy类代码及测试代码：

1.1 Candy.java 

public class Candy {
    public int candy(int[] ratings) {
        int m=ratings.length;
        int a[]=new int[m];
        int candy=0;
        a[0]=1;
//向右遍历
        for(int i=1;i<=ratings.length-1;i++){
            if(ratings[i]>ratings[i-1]){
                a[i]=a[i-1]+1;
            }
            else
                a[i]=1;
        }
//向左遍历（容易出现问题）
        for(int j=ratings.length-1;j>0;j--){
            if(ratings[j-1]>ratings[j]){
                a[j-1]=Math.max(a[j]+1,a[j-1]);
            }
        }
        for(int n=0;n 
1.2 CandyTest.java
 
import java.util.Scanner;

public class Candytest {
    public static void main(String[] args) {
        int ARRAYLENGTH = 5;  //指定数组长度
        int a[] = new int[ARRAYLENGTH];
        Scanner sc=new Scanner(System.in);
        System.out.println("请输入数组：");
        for(int i = 0; i < a.length; i++){
            a[i] = sc.nextInt();
        }
        Candy c=new Candy();
        System.out.println("Candy="+c.candy(a));
    }