106_容器_自己实现HashMap_MyMap原始版_效率较低

public class MyMap {/** *自定义实现Map的功能！ *暂不完美！  *Map:存放键值对，根据键对象找对应的值对象.键不能重复！ */class  Entry {    Object key;    Object value;    public Entry(Object key, Object value) {        super();        this.key = key;        this.value = value;    }   }    Entry[]  arr  = new Entry[999];    int size;    public void put(Object key,Object value){        Entry e = new Entry(key,value);        //解决键值重复的处理        for(int i=0;i<size;i++){            if(arr[i].key.equals(key)){                arr[i].value=value;                return ;            }        }        arr[size++] = e;    }    public Object get(Object key){        for(int i=0;i<size;i++){            if(arr[i].key.equals(key)){                return arr[i].value;            }        }        return null;    }    public boolean containsKey(Object key){        for(int i=0;i<size;i++){            if(arr[i].key.equals(key)){                return true;            }        }        return false;    }    public boolean containsValue(Object value){        for(int i=0;i<size;i++){            if(arr[i].value.equals(value)){                return true;            }        }        return false;    }    public static void main(String[] args) {        MyMap m = new MyMap();        m.put("高琪", new Wife("杨幂"));        m.put("高琪", new Wife("李四"));        Wife w = (Wife) m.get("高琪");        System.out.println(w.name); //李四    }}class Wife{    String name;    public Wife(String name) {        this.name=name;    }}