import java.util.Arrays;

/**
 * 輸入一個(gè)數(shù)組，1, 5, 6, 2, 3, 4, 5, 6, 1, 2
 * 1,5,6有序長(zhǎng)度為3,  2,3,4,5,6有序長(zhǎng)度為5， 1,2有序長(zhǎng)度為2
 * 輸出他們最常的有序長(zhǎng)度為5
 * Created by hjt on 2020/3/14.
 */
public class LongestSortedLengthDemo {
    public static void main(String[] args) {
 //       int[] b = {};
//        int[] b = {1};
//        int[] b = {1, 2};
//        int[] b = {2,1};
//        int[] b = {2,1,2,3,123,1,2};
        int[] b = {1, 5, 6, 2, 3, 4, 5, 6, 1, 2, 3, 4, 5, 6, 7, 8};
        //int[] b = {1, 5, 6, 2, 3, 4, 5, 6, 1, 2};
        int longestOrderedStringLength = longestOrderedStringLength(b);
        System.out.println("數(shù)組" + Arrays.toString(b) + "最長(zhǎng)有序長(zhǎng)度:" + longestOrderedStringLength);
    }

    public static int longestOrderedStringLength(int[] data) {
        if (data == null || data.length == 0) {
            return 0;
        }
        if (data.length == 1) {
            return 1;
        }
        int dataLen = data.length;
        int lastInt = data[0];
        int maxOrderedLength = 1;
        int lastOrderedLength = 1;
        for (int i = 1; i < dataLen; i++) {
            int nowInt = data[i];
            if (nowInt >= lastInt) {
                lastOrderedLength++;
                if (lastOrderedLength > maxOrderedLength) {
                    maxOrderedLength = lastOrderedLength;
                }
            }else {
                if (lastOrderedLength > maxOrderedLength) {
                    maxOrderedLength = lastOrderedLength;
                }
                lastOrderedLength = 1;
            }
            lastInt = nowInt;
        }
        return maxOrderedLength;
    }
}