一.编程题
题目1:
排序子序列_牛客笔试题_牛客网 (nowcoder.com)
题意:排序子序列为非递增或非递减的
1.三种情况:非递增序列判断:arry[ i ]<arry [ i+1 ]
非递减序列判断:arry[ i ]>arry [ i+1 ]
既是非递增也是非序列:arry[ i ]==arry [ i+1 ]
2.数组越界情况:解决方案:while(i<n&&) and 数组定义为[n+1]个
public class Study {
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
int n = scan.nextInt();
int[] array = new int[n+1];
for(int i = 0;i < n;i++) {
array[i] = s