201909-2小明种苹果(续)

题目:


代码:

 import java.util.Scanner;

public class PlantApple2 {
    
    public static void main(String[] args) {
        int n;
        int m;
        int a;
        int num=0;
        int totalNum=0;
        boolean isDrop=false;
        int dropNum=0;
        boolean[] dropTree;
        Scanner scan = new Scanner(System.in);
        
        n = scan.nextInt();
        dropTree = new boolean[n+2]; 
        
        for(int i=1;i<=n;i++) {
            m = scan.nextInt();
            for(int j=1;j<=m;j++) {
                a = scan.nextInt();
                if(a>0) {
                    if(num!=0)
                        if(num>a)
                            isDrop = true;      
                    num = a;    
                }
                else
                    num+=a;
            }
            
            totalNum+=num;
            
            dropTree[i+1] = isDrop;
            if(i == n-1)
                dropTree[0] = isDrop;
            if(i == n)
                dropTree[1] = isDrop;
            
            if(isDrop) {
                dropNum++;
                isDrop = false;
            }
        }
        
        int dropCount = 0;
        int continueNum =0;
        for(int k=0;k<dropTree.length;k++) {
            if(dropTree[k])
                dropCount++;
            else
                dropCount = 0;
            if(dropCount >= 3) 
                continueNum++;
            
        }
        
        
        
        System.out.print(totalNum+" ");
        System.out.print(dropNum+" ");
        System.out.print(continueNum+" ");
    }

}

一定要把代码中用于测试的内容(如system.out)删除,不然真的是白费功夫!!!

主类名称改为Main

©著作权归作者所有,转载或内容合作请联系作者
平台声明:文章内容(如有图片或视频亦包括在内)由作者上传并发布,文章内容仅代表作者本人观点,简书系信息发布平台,仅提供信息存储服务。

推荐阅读更多精彩内容