817. Linked List Components

版权声明:本文为博主原创文章,未经博主允许不得转载。 https://blog.csdn.net/zjucor/article/details/79949981

We are given head, the head node of a linked list containing unique integer values.

We are also given the list G, a subset of the values in the linked list.

Return the number of connected components in G, where two values are connected if they appear consecutively in the linked list.

Example 1:

Input: 
head: 0->1->2->3
G = [0, 1, 3]
Output: 2
Explanation: 
0 and 1 are connected, so [0, 1] and [3] are the two connected components.

Example 2:

Input: 
head: 0->1->2->3->4
G = [0, 3, 1, 4]
Output: 2
Explanation: 
0 and 1 are connected, 3 and 4 are connected, so [0, 1] and [3, 4] are the two connected components.

Note:

  • If N is the length of the linked list given by head1 <= N <= 10000.
  • The value of each node in the linked list will be in the range [0, N - 1].
  • 1 <= G.length <= 10000.
  • G is a subset of all values in the linked list.

union find

# Definition for singly-linked list.
class ListNode:
    def __init__(self, x):
        self.val = x
        self.next = None

class Solution:
    def numComponents(self, head, G):
        """
        :type head: ListNode
        :type G: List[int]
        :rtype: int
        """
        s = set(G)
        tmp = head
        l = 0
        a = []
        while tmp:
            l+=1
            a.append(tmp.val)
            tmp=tmp.next
        
        def union(i,j):
            a[j] = a[i]
            
        tmp = head
        while tmp:
            if tmp.val in s:
                if tmp.next and tmp.next.val in s:
                    union(tmp.val, tmp.next.val)
            tmp = tmp.next
        
        return len(set([a[i] for i in G]))
    
s=Solution()
t=ListNode(0)
t.next=ListNode(1)
t.next.next=ListNode(2)
t.next.next.next=ListNode(3)
t.next.next.next.next=ListNode(4)
print(s.numComponents(t, [0,3,1,4]))


阅读更多
想对作者说点什么?

博主推荐

换一批

没有更多推荐了,返回首页