验证数组是否是有序数列（面试必刷题经典示例题）

一、题目描述

判断一个数组或序列是正序,倒序还是乱序.给定N个整型数组,请输出每一个数组是正序,倒序,还是乱序

二、任务样例

样例输入 Copy
{[1,2,3,4,5],[4,5,6,7,1],[9,8,6,4,2]}
样例输出 Copy
正序,乱序,倒序

三、完整代码

import java.util.*;

public class Main {

	public static void main(String[] args){
		Scanner cin = new Scanner(System.in);
		String a;
		a = cin.nextLine();
		a = a.substring(2,a.length()-2);
		String[] tts = a.split("\\],\\[");
		for(int ii = 0;ii < tts.length;++ii){
			String[] s = tts[ii].split(",");
			int[] nums = new int[s.length];
			for(int i = 0;i < s.length;++i){
				nums[i] = Integer.parseInt(s[i]);
			}
			int cnt = 0;
			for(int i = 0;i < nums.length - 1;++i){
				if(nums[i+1] < nums[i]){
					int temp = nums[i];
					nums[i] = nums[i+1];
					nums[i+1] = temp;
					cnt++;
				}
			}
			if(cnt == 0){
				System.out.print("正序");
			}else if(cnt == nums.length - 1){
				System.out.print("倒序");
			}else{
				System.out.print("乱序");
			}
			if(ii != tts.length-1)System.out.print(",");
		}
	}
}