466 链表节点计数

原题网址: http://www.lintcode.com/zh-cn/problem/count-linked-list-nodes/

计算链表中有多少个节点.

样例

给出 1->3->5, 返回 3.

标签 
 
 1 /**
 2  * Definition of singly-linked-list:
 3  * class ListNode {
 4  * public:
 5  *     int val;
 6  *     ListNode *next;
 7  *     ListNode(int val) {
 8  *        this->val = val;
 9  *        this->next = NULL;
10  *     }
11  * }
12  */
13 
14 class Solution {
15 public:
16     /**
17      * @param head: the first node of linked list.
18      * @return: An integer
19      */
20     int countNodes(ListNode * head) {
21         // write your code here
22         if (head==NULL)
23         {
24             return 0;
25         }
26         else
27         {
28             ListNode *p=head;
29             int total=1;
30             while (p->next!=NULL)
31             {
32                 total++;
33                 p=p->next;
34             }
35             return total;
36         }
37     }
38 };

 

posted @ 2018-03-29 15:54  eeeeeeee鹅  阅读(339)  评论(0编辑  收藏  举报