浪潮java笔试大题

最新推荐文章于 2025-07-13 13:06:14 发布

球球的秋秋

最新推荐文章于 2025-07-13 13:06:14 发布

阅读量8.4k

点赞数 6

CC 4.0 BY-SA版权

分类专栏：笔试题 Java 找工作

本文链接：https://blog.csdn.net/gjq5464/article/details/107313680

第一题石头
求最少操作多少次使得石头升序排列
只需求出最大递增1的子序列长度，再用总长度减去子序列长度

package 浪潮编程;

import java.util.Scanner;
public class Main {
   
   
	public static void main(String[] args) {
   
   
		Scanner in = new Scanner(System.in);

		int num = 1, max = 1;
		int tree = in.nextInt();
		if (tree <= 100000) {
   
   
			int[] c = new int[tree];
			int[] cc = new int[tree];
			for (int i = 0; i < tree; i++) {
   
   
				c[i] = in.nextInt();
			}
			if (tree < c.length)
				System.out.println(0);
			for (int i = 0; i < tree; i++) {
   
   
				cc[i] = c[i];
				for (int j = i + 1; j < tree; j++) {
   
   
					cc[j] = c[j];
					if (cc[i] + 1 == cc[j]) {
   
   
						num += 1;
						cc[i