contributed by < robertnthu >
測驗 1
EXP1 = a & b & 1
EXP2 = a & b
EXP3 = a ^ b
解釋運作原理
EXP1
- contributed by < robertnthu > 測驗 1 Two Sum map_add() AAA = n->next = first; BBB = n->pprev = &h->first; 首先，這個程式是要加入一個 hlist_node 到 map_t 裡面，而觀察可以判斷出，這個新的 hlist_node 要被加在最前面 （graphviz參考 jim12312321的圖並作筆記
謝柏陞 changed 3 years agoView mode
- contributed by < robertnthu > 環境設置 $ gcc --version gcc (Ubuntu 9.3.0-17ubuntu1~20.04) 9.3.0 $ uname -r 5.16.10-051610-generic $ lscpu
