surface pro还是thinkpad helix# PDA - 掌中宝
c*e
1 楼
This is from other people's 面经:
"判断两个single linkedlist 是否merge。从naive讲起,说到了linear的两种解法。"
I can think of two approaches:
1. Use hashtable.
2. Use the address of last node of each SLL to compare with each node of the
other SLL
Are these the "linear的两种解法"? Thanks.
"判断两个single linkedlist 是否merge。从naive讲起,说到了linear的两种解法。"
I can think of two approaches:
1. Use hashtable.
2. Use the address of last node of each SLL to compare with each node of the
other SLL
Are these the "linear的两种解法"? Thanks.