817-链表连通组件

标签: 算法 数据结构 leetcode
35人阅读 评论(0) 收藏 举报
分类:

Description:
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 head, 1 <= 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.

问题描述
给出链表的表头head,链表包含各不相同的整数
给出数组G,G的所有元素的值为链表的子集
返回G中的连通组件。如果两个值在链表中相邻则连通


例子

head指向0->1->2->3
G = [0, 1, 3]
输出2
解释:0和1是连通组件,3为连通组件


问题分析
将G的元素放入Set,遍历head,若遇到一个元素在Set中并且下一个元素为空或者不在Set中,则将
连通组件个数增1


解法

class Solution {
     public int numComponents(ListNode head, int[] G) {
        Set<Integer> setG = new HashSet<>();

        for (int i : G) setG.add(i);

        int res = 0;
        while (head != null) {
            if (setG.contains(head.val) && (head.next == null || !setG.contains(head.next.val))) res++;
            head = head.next;
        }

        return res;
    }
}
查看评论

4.9.链表&状态机与多线程

-
  • 1970年01月01日 08:00

817. Linked List Components

We are given head, the head node of a linked list containing unique integer values.We are also given...
  • zjucor
  • zjucor
  • 2018-04-15 15:55:59
  • 23

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
  • 10

double_linked_list in Python

# -*- coding: utf-8 -*- class Frob(object): def __init__(self, name): self.name = name ...
  • u013805817
  • u013805817
  • 2014-05-01 21:33:48
  • 1856

817-链表连通组件

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
  • 35

检索模型与搜索排序 学习

布尔模型 仅仅根据term后续的倒排列表进行布尔运算,获取最终的返回结果.无法进行排序打分. 空间向量模型 将搜索语句当成一片文档来解析成n维度空间中的某个点,与...
  • sqh201030412
  • sqh201030412
  • 2016-10-31 19:52:44
  • 920

scala LinkedList 瑕疵

@deprecated("Low-level linked lists are deprecated due to idiosyncrasies in interface and incomplete...
  • zhhz418418
  • zhhz418418
  • 2015-12-30 12:59:52
  • 371

leetcode 818. Race Car

leetcode 818. Race Car 原题地址:https://leetcode.com/problems/race-car/ 题目 Your car starts at pos...
  • birdreamer
  • birdreamer
  • 2018-04-16 11:05:30
  • 67

List总结(LinkedList, ArrayList等使用场景和性能分析)

(01) List 是一个接口,它继承于Collection的接口。它代表着有序的队列。 (02) AbstractList 是一个抽象类,它继承于AbstractCollection。Abstra...
  • Android_Mrchen
  • Android_Mrchen
  • 2018-03-15 11:00:29
  • 21

单链表实现一个栈

单链表实现的一个栈,只实现了栈的主要功能:push pop
  • nrj
  • nrj
  • 2014-10-12 21:34:22
  • 1366
    个人资料
    专栏达人 持之以恒
    等级:
    访问量: 2万+
    积分: 6912
    排名: 4307
    博客专栏
    文章存档
    最新评论