/**
* 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
int i = 0;
while (head)
{
i++;
head = head->next;
}
return i;
}
};
注意的地方是,进入判断语句时候判断的时候到没到链表的结尾
所以是head!+=NULL;
还要记住 需要将节点的指针指向下一个节点***