课堂练习（数组结对开发）

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

31

32

33

34

35

36

37

38

39

40

41

42

43

44

45

46

47

48

49

50

51

52

53

54

55

56

57

58

59

package shuzhi;

import java.util.Scanner;

public class shuzuzhi {

    public static void main(String[] args) {

        // TODO Auto-generated method stub

        Scanner in=new Scanner(System.in);

        System.out.println("请输入数组长度：");

        int n=in.nextInt();

        int array[]=new int[n];

        int result = 0;

        boolean bool=false;

        System.out.println("请输入相应的整数：");

        for(int i=0;i<n;i++)

        {

            array[i]=in.nextInt();

        }

        for(int i=0;i<n;i++)

        {

            if(array[i]>0)bool=true;

        }

     //判断是否全为负数  

    if(bool)//不全为负数

      {    

         //圈的循环

        for(int j=0;j<n;j++)

        {

         int max=array[j];

         int result1 =array[j];

           for(int i=0;i<n-j;i++)

            {

              max=max+array[i];

              if(max>result1)

              {

                result1=max;

              }

              if(max<0)

              {

               max=0;

              }

            }

           result=result1;

          }

        }

        else//全为负数

        {

            int max=array[0];

            for(int i=1;i<n;i++)

            {

                if(max<array[i])

                    max=array[i];

            }

            result=max;

        }

        System.out.print("子数组的最大值为："+result);

    }

}