华为机试：处理器问题

最新推荐文章于 2024-08-12 18:10:44 发布

不吃辣的蜗牛

最新推荐文章于 2024-08-12 18:10:44 发布

阅读量323

点赞数 10

文章标签：深度优先算法

本文链接：https://blog.csdn.net/qq_24388913/article/details/136488199

版权

这篇文章主要介绍了如何使用Java编程语言，通过DFS（深度优先搜索）算法解决处理器问题，处理输入数组并按特定规则输出结果。程序涉及数据结构如ArrayList和Scanner的使用。

摘要由CSDN通过智能技术生成

package 番外篇2024;

import java.util.ArrayList;
import java.util.Arrays;
import java.util.List;
import java.util.Scanner;

public class 处理器问题 {
	static int num;
	static ArrayList<Integer> line1 = new ArrayList<Integer>();
	static ArrayList<Integer> line2 = new ArrayList<Integer>();
	static List<Integer> res = new ArrayList<Integer>();

	public static void main(String[] args) {
		// TODO Auto-generated method stub
		Scanner sc = new Scanner(System.in);
		int[] a = Arrays.stream(sc.nextLine().split("[\\[\\]\\,\\s]")).filter(str -> !"".equals(str))
				.mapToInt(Integer::parseInt).toArray();
		num = sc.nextInt();
		for (int temp : a) {
			if (temp < 4) {
				line1.add(temp);
			} else {
				line2.add(temp);
			}
		}
		if (num == 1) {
			if (line1.size() == 1 || line2.size() == 1) {
				if (line1.size() == 1) {
					dfs(1, 0, line1);
				} else {
					dfs(1, 0, line2);
				}
			} else if (line1.size() == 3 || line2.size() == 3) {
				if (line1.size() == 3) {
					dfs(3, 0, line1);
				} else {
					dfs(3, 0, line2);
				}
			} else if (line1.size() == 2 || line2.size() == 2) {
				if (line1.size() == 2) {
					dfs(2, 0, line1);
				} else {
					dfs(2, 0, line2);
				}
			} else if (line1.size() == 4 || line2.size() == 4) {
				if (line1.size() == 4) {
					dfs(4, 0, line1);
				} else {
					dfs(4, 0, line2);
				}
			}
		}
		if (num == 2) {
			if (line1.size() == 2 || line2.size() == 2) {
				if (line1.size() == 2) {
					dfs(2, 0, line1);
				} else {
					dfs(2, 0, line2);
				}
			} else if (line1.size() == 4 || line2.size() == 4) {
				if (line1.size() == 4) {
					dfs(4, 0, line1);
				} else {
					dfs(4, 0, line2);
				}
			} else if (line1.size() == 3 || line2.size() == 3) {
				if (line1.size() == 3) {
					dfs(3, 0, line1);
				} else {
					dfs(3, 0, line2);
				}
			}
		}
		if (num == 4) {
			if (line1.size() == 4 || line2.size() == 4) {
				if (line1.size() == 4) {
					dfs(4, 0, line1);
				} else {
					dfs(4, 0, line2);
				}
			}
		}
		if (num == 8) {
		}
		for (int print : res) {
			System.out.print(print + " ");
		}
	}

	static void dfs(int level, int index, ArrayList<Integer> arr) {
		if (level <= res.size()) {
			return;
		}
		for (int i = index; i < arr.size(); i++) {
			if (level <= res.size()) {
				return;
			}
			res.add(arr.get(i));
			dfs(level, index + 1, arr);

		}
	}

}