易错

每次comparator都不记得写object的leixing

 Arrays.sort ( intervals, new Comparator<Interval> (){
            public int compare ( Interval in1, Interval in2 ){
                return in1.start - in2.start;
            }
        });



HashMap 

void clear()
Removes all of the mappings from this map.
Object clone()
Returns a shallow copy of this  HashMap instance: the keys and values themselves are not cloned.
boolean containsKey(Object key)
Returns  true if this map contains a mapping for the specified key.
boolean containsValue(Object value)
Returns  true if this map maps one or more keys to the specified value.
Set<Map.Entry<K,V>> entrySet()
Returns a  Set view of the mappings contained in this map.
V get(Object key)
Returns the value to which the specified key is mapped, or  null if this map contains no mapping for the key.
boolean isEmpty()
Returns  true if this map contains no key-value mappings.
Set<K> keySet()
Returns a  Set view of the keys contained in this map.
V put(K key, V value)
Associates the specified value with the specified key in this map.
void putAll(Map<? extends K,? extends V> m)
Copies all of the mappings from the specified map to this map.
V remove(Object key)
Removes the mapping for the specified key from this map if present.
int size()
Returns the number of key-value mappings in this map.
Collection<V> values()
Returns a  Collection view of the values contained in this map.

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

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

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

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值