突然發現有點久沒紀錄= =
今天每日是
19. remove Nth Node from end of list
叫你刪除從後面數的第N個節點
解法：
直接先看看有幾個
然後再算要刪的是從前面數的第幾個
超級單純的做法
等等來看其他人怎麼寫的
嘿嘿嘿
class Solution {
public:
ListNode* removeNthFromEnd(ListNode* head, int n)
{
int all = 0 ;
ListNode* go = head;
while(go != NULL)
{
go = go->next;
all ++;
}
if(all == 1)return NULL;
if(n == all)return head->next;
go = head;
all = all - n;
ListNode* pre ;
for(int i = 0 ; i < all-1 ; i++)
{
pre = go;
go = go->next;
}
if(go->next->next != NULL)
{
go->next = go->next->next;
return head;
}
if(go->next->next == NULL)
{
go->next = NULL;
}
return head;
}
};