LintCode 466鏈表節點計數

思路 遍歷訪問數個數 /** * Definition of singly-linked-list: * class ListNode { * public: * int val; * ListNode *next; * ListNode(int val) { * this->val = val; * this->next = NULL; * } * } */ class Solution { p

>>阅读原文<<