编程初学者入门10_输入整数序列，判断是否是有序序列，有序，指序列的整数从小到大排序或者从大到小排序。(C/C++的break跳出几层循环、Java实现Arrays.sort排序数组

#include<bits/stdc  .h>
using namespace std;
int main()
{
    int len,arr_num,flag_sheng = 0,flag_ni = 0;
    cin>>len;
    int arr[len];
    for(int i = 0;i<len;i  ){
        cin>>arr_num;
        arr[i] = arr_num;
        
    }
	//判断升序
    for(int i = 0;i<len;i  ){
        for(int j = i 1;j<len;j  ){
            if(arr[i] <= arr[j])
                flag_sheng = 1;
            
            else{
                flag_sheng = 0;
                break;
            }
         
        }
        //跳出外层循环，否则易出现后面的正确顺序，而flag 又重新赋值为 1 
        if(flag_sheng == 0)
            break;
    }
    //判断降序
    for(int i = 0;i<len;i  ){
        for(int j = i 1;j<len;j  ){
            if(arr[i] >= arr[j])
                flag_ni = 1;
            
            else{
                flag_ni = 0;
                break;
            }
                
        }
        //跳出外层循环，否则易出现后面的正确顺序，而flag 又重新赋值为 1 
        if(flag_ni == 0)
            break;
        
    }
    if(flag_sheng ==1 || flag_ni == 1 )
        cout<<"sorted"<<endl;
    else
        cout<<"unsorted"<<endl;
    
    
 
    
}

import java.util.Scanner;
import java.lang.*;
import java.util.Arrays;

public class Main{
    public static void main(String args[]){
        Scanner sc = new Scanner(System.in);
        int len = sc.nextInt();
        int flag_sheng = 1,flag_ni = 1;
        //输入的数组，和新的放排序后元素的数组
        int [] arr = new int[len];
        int [] arr_sort = new int[len];
        
        for(int i = 0;i<len;i  ){
            arr[i] = sc.nextInt();
            arr_sort[i] = arr[i];
        }
        //对输入的数排序
        Arrays.sort(arr_sort);
        //循环对比
        for(int i = 0;i<len;i  ){
            if(arr_sort[i] != arr[i])
                flag_sheng = 0;
            if(arr_sort[len -1 - i] != arr[i])
                flag_ni = 0;
                
        }
        if(flag_ni == 1 || flag_sheng == 1)
            System.out.println("sorted");
        else
            System.out.println("unsorted");
        
        
            
        
    }
}