度熊手上有一本神奇的字典，你可以在它里面做如下三个操作：结果符合为何交不上去...

import java.util.LinkedList;
import java.util.Scanner;

public class Main{
	static LinkedList<String> array=new LinkedList<String>();	
	static Scanner scan=new Scanner(System.in);
	public static int number(){
		int ss1=scan.nextInt();
		scan.nextLine();
		return ss1;
	}
	public static String[] number2(){
		String c="";
		String c1[]=null;
		int i1[]=null;
		c=scan.nextLine();
		c1=c.split(" ");
		return c1;
	}
	
	public static void str(String[] i1){
		boolean c;
		boolean c1 = false;
		String s2=i1[0];
		switch(s2){
		case "insert":
			array.add(i1[1]);
			break;
		
		case "delete":
			for(int i=0;i<array.size();i++){
				String s1=array.get(i);
				c=i1[1].regionMatches(0, s1, 0, i1[1].length());
				if(c==true){
					array.remove(i);
				}
			}
			break;
		case "search":
			for(int i=0;i<array.size();i++){
				String s1=array.get(i);
				c1=i1[1].regionMatches(0, s1, 0, i1[1].length());
				if(c1==true){
					System.out.println("Yes");
					break;
				}
			}
			if(c1!=true){
				System.out.println("No");
			}
			break;
		default :
			System.out.println("");
			break;
		}
		
	}
	public static void main(String args[]){
		String i1[]=null;
		int num=number();
		for(int i=0;i<num;i++){
			i1=number2();
			str(i1);
		}
	}
}

 

转载于:https://my.oschina.net/xiaoshuojia/blog/675125