deadline是第一生产力,刚刚收到笔试通知的我到现在居然一道题还没来得及刷,赶紧开始LeetCode刷题记
从回忆版的题入手,据说是今年amazon电面的题,have a try
206. Reverse Linked List
难度:
Easy
思路:
就是个简单链表反转的水题,注意输入可能是空链表这种特殊情况
代码:
/*
Author Owen_Q
*/
/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode(int x) : val(x), next(NULL) {}
* };
*/
class Solution {
public:
ListNode* reverseList(ListNode* head) {
if(head == NULL)
return NULL;
int n=1;
int l[1000010];
l[0] = head->val;
while(head->next!=NULL)
{
head = head->next;
l[n++] = head->val;
}
ListNode* newHead = new ListNode(l[n-1]);