简历：The Google Resume: How to Prepare for a Career and Land a Job at Apple, Microsoft, Google, or any Top Tech Company
算法学习书籍：Introduction to Algorithms
编程珠玑：Programming Pearls (2nd Edition)
C++ 学习：The C++ Programming Language, 4th Edition
经典操作系统书籍，龙书：Operating System Concepts
创业：The Start-up of You: Adapt to the Future, Invest in Yourself, and Transform Your Career
Given a linked list, swap every two adjacent nodes and return its head.
For example,
Given
Given
1->2->3->4, you should return the list as 2->1->4->3.
Your algorithm should use only constant space. You may not modify the values in the list, only nodes itself can be changed.
» Solve this problem今儿是什么喵喵人品，早上被告知att欠的500刀被神奇解决，然后晚上刷题2个都1次ac。那种看到自己代码被大小case都accept带来的高兴是很神奇的。（所谓的学习的快感？欧吼吼～～～）
上代码。补一个safeguard 是亮点。
No comments:
Post a Comment