计算链表中有多少个节点.
样例:
给出 1->3->5, 返回 3.
#ifndef C466_H
#define C466_H
#include<iostream>
using namespace std;
/*
* Count how many nodes in a linked list.
*
* Example
* Given 1->3->5, return 3.
*/
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