java
jason_0_08
这个作者很懒,什么都没留下…
展开
-
哲学家就餐问题解决方案(java)
public class Solution implements Runnable { Semaphore first=new Semaphore(3); Semaphore second=new Semaphore(2); boolean[] chopsticks =new boolean[5]; @Override public void run() { int id=((int)Thread.currentThread().getId())%5; try { getchopst原创 2021-06-11 15:18:02 · 149 阅读 · 1 评论 -
HashMap.putVal方法解析
HashMap.putVal方法解析final V putVal(int hash, K key, V value, boolean onlyIfAbsent, boolean evict) { Node<K, V>[] tab; Node<K, V> p; int n, i; //初始化hashmap if ((tab = table) == null || (n = tab.length) == 0) n = (tab = resize()).le原创 2021-03-02 12:51:32 · 136 阅读 · 0 评论