适合数据分析面试笔试入门的编程题

import java.util.Arrays;
import java.util.Collections;
import java.util.Scanner;
import java.util.Comparator;


public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int n = scanner.nextInt(); //苹果个数
        int m = scanner.nextInt(); //疏果个数
        int t = 0;// 总数剩下的
        int k = 0; // 苹果树编号
        int p = 0; //疏果格式
        int tempk = 0; //临时k变量

        for (int i = 0; i < n; i++) {
            int simple = scanner.nextInt();
            t += simple;
            tempk++;
            int tempp = 0;

            for (int j = 0; j < m; j++) {
                int filter = scanner.nextInt();
                tempp -= filter;
                t += filter;
            }
            if (tempp > p) {
                p = tempp;
                k = tempk;
            }
        }
        System.out.println(t + " " + k + " " + p);
    }
}

import java.util.*;

public class Main {

    public static void main(String[] args) {
        // TODO Auto-generated method stub
        Scanner scanner = new Scanner(System.in);
        int n = scanner.nextInt(); //苹果树棵树
        int t = 0; //总苹果数量
        int d = 0; //发生掉落苹果树数量
        int e = 0; //连续三棵掉落的苹果树
        int apple[] = new int[n];

        for (int i = 0; i < n; i++) {
            int m = scanner.nextInt();
            int temptotal = 0;
            int flag = 0;
            int firstrecord = scanner.nextInt();
            temptotal += firstrecord;

            for (int j = 1; j < m; j++) {
                int filter = scanner.nextInt();
                if (filter <= 0) {
                    temptotal += filter;
                } else {
                    if (filter < temptotal) {
                        flag = 1;
                        temptotal = filter;
                    }
                }
            }
            t += temptotal;
            if (flag == 1) {
                apple[i] = 1;
                d++;
            }
        }

        for (int k = 0; k < n; k++) {
            int p = k + 1;
            int q = k + 2;
            if (p >= n) {
                p -= n;
            }
            if (q >= n) {
                q -= n;
            }
            if ((apple[k] & apple[p] & apple[q]) == 1) {
                e++;
            }
        }

        System.out.println(t + " " + d + " " + e);

    }
}