zoukankan      html  css  js  c++  java
  • 349. Intersection of Two Arrays

    Given two arrays, write a function to compute their intersection.

    Example:
    Given nums1 = [1, 2, 2, 1]nums2 = [2, 2], return [2].

    Note:

      • Each element in the result must be unique.
      • The result can be in any order.

    题目含义:求两个数组的公共元素(重复多次的只记录一个)

     1     public int[] intersection(int[] nums1, int[] nums2) {
     2         Set<Integer> values = new HashSet<>();
     3         for (int number:nums1) values.add(number);
     4 
     5         Set<Integer> commons = new HashSet<>();
     6         for (int number:nums2)
     7         {
     8             if (values.contains(number)) commons.add(number);
     9         }
    10         int[] result = new int[commons.size()];
    11         Iterator<Integer> it =  commons.iterator();
    12         for (int i=0;i<commons.size();i++)
    13         {
    14             result[i] = it.next();
    15         }
    16         return result;     
    17     }
  • 相关阅读:
    QuartzQuartz定时任务
    jdbc模糊查询、分页查询、联合查询
    PreparedStatement
    web服务器简述
    JDBC基本操作
    RMI
    Http编程
    2020毕业季业务开发宝典
    程序设计流程图
    系统概要框图
  • 原文地址:https://www.cnblogs.com/wzj4858/p/7718907.html
Copyright © 2011-2022 走看看