华为机试练习---java实现电话号码本

package huawei;

import java.util.HashMap;
import java.util.Iterator;
import java.util.LinkedHashMap;
import java.util.Map;
import java.util.Map.Entry;
import java.util.Scanner;
import java.util.Set;

/**
 * java实现电话号码本
 * @author USER
 *
 */
public class Telephone {
	public static void main(String[] args) {
		
		HashMap<String, String> map = new LinkedHashMap<String, String>();
		String[] info = null;
		
		Scanner in = new Scanner(System.in);
		String string = null;
		
		while ((string = in.nextLine()) != null) {
			info = string.split(" "); 
			String command = null;
			String name = null;
			String phone = null;
			
			command = info[0];
			switch (command) {
			case "save":
				name = info[1];
				phone = info[2];
				if (name.length()>20 || phone.length()>20 || map.containsKey(name) || map.containsValue(phone) || name.length()==0 || phone.length()==0) {
					System.out.println("error");
				}else {
					map.put(name, phone);
					System.out.println(name+" "+phone);
				}
				break;
			case "getName":
				phone = info[1];
				//怎么从map值找关键字
				Set<String> set = map.keySet();
				Iterator<String> it = set.iterator();
				if (map.containsValue(phone)) {
					while (it.hasNext()) {
						if (map.get(it.next()).equals(phone)) {
							System.out.println(it.next());
						}
					}
				}else {
					System.out.println("error");
				}
				break;
			case "getPhonenum":
				name = info[1];
				if (map.containsKey(name)) {
					System.out.println(map.get(name));
				}else {
					System.out.println("error");
				}
				break;
			case "delete":
				name = info[1];
				if (map.containsKey(name)) {
					map.remove(name);//删除键值,也删除了对应的值
					System.out.println("OK");
				}else {
					System.out.println("error");
				}
				break;
			case "count":
				if (map.size()>200) {
					System.out.println("out of the max memory");
				}else {
					System.out.println(map.size());
				}
				break;
			case "clear":
				map.clear();
				break;
			case "display":
/*				Set<Entry<String, String>> mapset = map.entrySet();
				Iterator<Entry<String, String>> its = mapset.iterator();
				while (its.hasNext()) {
					Map.Entry<String,String> entry = (Map.Entry<String,String>) its.next();
					String key = entry.getKey();
					String value = entry.getValue();
					System.out.println(key+":"+value);
				}*/
				Set<String> sets = map.keySet();
				for (String str : sets) {
					System.out.println(str+":"+map.get(str));
				}
				break;
			default:
				System.out.println("error,please input again:");
				break;
			}
		}
	}
}

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值