817. Linked List Components

21人阅读 评论(0) 收藏 举报
分类:

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]))


查看评论

817-Linked List Components

Description: We are given head, the head node of a linked list containing unique integer values. W...
  • LaputaFallen
  • LaputaFallen
  • 2018-04-15 18:48:12
  • 25

leetcode 817. Linked List Components

leetcode 817. Linked List Components 原题地址:https://leetcode.com/problems/linked-list-components/ ...
  • birdreamer
  • birdreamer
  • 2018-04-15 22:02:45
  • 9

double linked list双向链表

[tags] C++双向链表的实现与单向链表相近 节点结构体 类声明 总结双向链表的实现(与单向链表相近)1. 节点结构体struct DouListNode { int elem; DouL...
  • lichen_yun
  • lichen_yun
  • 2016-04-27 21:28:24
  • 732

C++链表(single-linked list)

直接代码,代码是最好的说明 //IntSLList.h #ifndef INTSLLIST_H #define INTSLLIST_H class IntSLLNode { public: Int...
  • nie2314550441
  • nie2314550441
  • 2016-03-03 16:08:16
  • 452

234. Palindrome Linked List [easy] (Python)

题目链接https://leetcode.com/problems/palindrome-linked-list/题目原文 Given a singly linked list, determin...
  • coder_orz
  • coder_orz
  • 2016-05-03 19:09:18
  • 1783

Circular Doubly Linked List 双向循环链表 C++ 例子

What a circular doubly linked list looks like? Look at Figure1, It is a circular doubly linke...
  • fox64194167
  • fox64194167
  • 2013-04-15 10:42:46
  • 2622

206. Reverse Linked List [easy] (Python)

题目链接https://leetcode.com/problems/reverse-linked-list/题目原文 Reverse a singly linked list. 题目翻译翻转单向链...
  • coder_orz
  • coder_orz
  • 2016-05-03 17:12:10
  • 2696

*** glibc detected *** mainwindow: malloc(): smallbin double linked list corrupted: 0x01a73ab8 ***

1.先看看在glibc malloc的实现机制 /*   This struct declaration is misleading (but accurate and necessary). ...
  • occupy8
  • occupy8
  • 2012-10-12 10:39:02
  • 5931

leetcode 206: Reverse Linked List

Reverse Linked List leetcode
  • xudli
  • xudli
  • 2015-05-14 06:47:30
  • 13881

smallbin double linked list corrupted

[20131210205216] G1002 Ftp Waitting.. *** glibc detected *** /home/gdsbi/aiinsight/aitools/bin/tcls...
  • link200809
  • link200809
  • 2013-12-11 04:37:41
  • 1987