2015年7月17日
[LeetCode] Rotate List
摘要： Well, in the case of a linked list instead of an array, the problem becomes easier. We just need to find the node that will be the new head of the lis... 阅读全文
posted @ 2015-07-17 07:39 jianchao-li 阅读(174) 评论(0) 推荐(0)
[LeetCode] Rotate Array
摘要： This problem, as stated in the problem statement, has a lot of solutions. Since the problem requires us to solve it in O(1) space complexity, I only s... 阅读全文
posted @ 2015-07-17 07:04 jianchao-li 阅读(172) 评论(0) 推荐(0)