给出链表 3->2->1->5->null和n = 2,返回倒数第二个节点的值1
class Solution {
public:
/**
* @param head: The first node of linked list.
* @param n: An integer.
* @return: Nth to last node of a singly linked list.
*/
ListNode *nthToLast(ListNode *head, int n) {
// write your code here
ListNode* aaa;
if ( head == NULL) {
return NULL;
}
aaa = head;
int ccc = 0;
while (aaa -> next != NULL) {
aaa = aaa -> next;
ccc++;
}
aaa = head;
for ( int i = 0; i < ccc-n+1; i++) {
aaa = aaa ->next;
}
return aaa;
}
};
解题思路及感受:自己定义一个节点,利用这一个节点标记自己需要找的值,然后输出他