BUPT2011计院机试Java题解

最新推荐文章于 2020-03-25 22:10:36 发布

lwang0307

最新推荐文章于 2020-03-25 22:10:36 发布

阅读量79

点赞数

分类专栏：考研机试真题

本文链接：https://blog.csdn.net/qq_39419821/article/details/105016837

版权

考研机试真题专栏收录该内容

21 篇文章 0 订阅

订阅专栏

题目搜集于各位前辈，侵删。

第一题

在这里插入图片描述

import java.util.Scanner;

public class c1101 {

	public static void main(String[] args) {
		// TODO Auto-generated method stub
		Scanner sc = new Scanner(System.in);
		while(sc.hasNext()) {
			String s = sc.nextLine();
			String[] ss = s.split(" ");
			for(int i = ss.length-1;i>=0;i--) {
				if(i==ss.length-1) {
					System.out.print(ss[i].toLowerCase());
				}else {
					System.out.print(" "+ss[i].toLowerCase());
				}
			}
			System.out.println();
		}
		sc.close();
	}

}

第二题

在这里插入图片描述

import java.util.HashMap;
import java.util.Map;
import java.util.Scanner;

public class c1102 {

	public static void main(String[] args) {
		// TODO Auto-generated method stub
		Scanner sc = new Scanner(System.in);
		int T = sc.nextInt();
		for(int t=0;t<T;t++) {
			int n = sc.nextInt();
			Map<Integer,Integer> map = new HashMap<Integer,Integer>();
			for(int i = 0;i<n;i++) {
				String op = sc.next();
				if(op.equals("Insert")) {
					int key = sc.nextInt();
					int value = sc.nextInt();
					map.put(key, value);
				}else {
					int key = sc.nextInt();
					if(!map.containsKey(key)) {
						System.out.println("No result!");
					}else{
						int value = map.get(key);
						System.out.println("name:"+key+" score:"+value);
					}
				}
			}
		
		}
		sc.close();
	}

}

第三题

在这里插入图片描述

6 5 5
0 1
0 2
1 3
2 4
2 5

import java.util.ArrayList;
import java.util.LinkedList;
import java.util.Queue;
import java.util.Scanner;

public class c1103 {

	public static void main(String[] args) {
		// TODO Auto-generated method stub
		Scanner sc = new Scanner(System.in);
		int m = sc.nextInt();
		int n = sc.nextInt();
		int l = sc.nextInt();
		Node root = new Node(0);
		for(int i = 0;i<n;i++) {
			int fatherValue = sc.nextInt();
			int sonValue = sc.nextInt();
			Node father = search(root,fatherValue);
			Node son = new Node(sonValue);
			son.father = father;
			father.sons.add(son);
		}
		
		double ans = 1;
		Node node = search(root,l);
		while(node.father!=null) {
			ans*=node.father.sons.size();
			node = node.father;
		}
		System.out.println(String.format("%.6f", 1.0/ans));
		
	}
	
	static class Node{
		int value;
		ArrayList<Node> sons = new ArrayList<Node>();
		Node father = null;
		public Node(int value) {
			super();
			this.value = value;
		}
	}
	
	static Node search(Node root,int value) {
		Queue<Node> queue = new LinkedList<Node>();
		queue.add(root);
		while(!queue.isEmpty()) {
			Node node = queue.remove();
			if(node.value==value) {
				return node;
			}else {
				for(Node son:node.sons) {
					queue.add(son);
				}
			}
		}
		return null;
	}

}