leetcode 817. Linked List Components 链表组件-耗时100%

Problem: 817. Linked List Components 链表组件

解题过程

耗时100%，状态标记的，对nums内的数字标记true，然后一次遍历链表即可，前一个状态pre = false，若当前status[ptr->val] == true && pre == false则计数+1，向后延伸就行了

Code

/** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * ListNode() : val(0), next(nullptr) {} * ListNode(int x) : val(x), next(nullptr) {} * ListNode(int x, ListNode *next) : val(x), next(next) {} * }; */ class Solution { public: bool status[10001]; int numComponents(ListNode* head, vector<int>& nums) { memset(status, 0, sizeof(status)); for(int i = 0; i < nums.size(); i++) { status[ nums[i] ] = true; } ListNode *ptr, *tmp; ptr = head; bool pre = false; int cnt = 0; while(ptr!=nullptr) { if(status[ptr->val] == true && pre == false) { cnt++; } pre = status[ptr->val]; ptr = ptr->next; } return cnt; } };