计算链表中有多少个节点.
样例
样例 1:
输入: 1->3->5->null
输出: 3
样例解释:
返回链表中结点个数,也就是链表的长度.
样例 2:
输入: null
输出: 0
样例解释:
空链表长度为0
/**
* Definition of singly-linked-list:
* class ListNode {
* public:
* int val;
* ListNode *next;
* ListNode(int val) {
* this->val = val;
* this->next = NULL;
* }
* }
*/
class Solution {
public:
/**
* @param head: the first node of linked list.
* @return: An integer
*/
int countNodes(ListNode * head)
{
// write your code here
if(head == NULL)
return 0;
if(head->next == NULL)
return 1;
return 1 + countNodes(head->next);
}
};