当前位置: 首页 > news >正文

LeetCode75——Day20

文章目录

    • 一、题目
    • 二、题解

一、题目

2215. Find the Difference of Two Arrays

Given two 0-indexed integer arrays nums1 and nums2, return a list answer of size 2 where:

answer[0] is a list of all distinct integers in nums1 which are not present in nums2.
answer[1] is a list of all distinct integers in nums2 which are not present in nums1.
Note that the integers in the lists may be returned in any order.

Example 1:

Input: nums1 = [1,2,3], nums2 = [2,4,6]
Output: [[1,3],[4,6]]
Explanation:
For nums1, nums1[1] = 2 is present at index 0 of nums2, whereas nums1[0] = 1 and nums1[2] = 3 are not present in nums2. Therefore, answer[0] = [1,3].
For nums2, nums2[0] = 2 is present at index 1 of nums1, whereas nums2[1] = 4 and nums2[2] = 6 are not present in nums2. Therefore, answer[1] = [4,6].
Example 2:

Input: nums1 = [1,2,3,3], nums2 = [1,1,2,2]
Output: [[3],[]]
Explanation:
For nums1, nums1[2] and nums1[3] are not present in nums2. Since nums1[2] == nums1[3], their value is only included once and answer[0] = [3].
Every integer in nums2 is present in nums1. Therefore, answer[1] = [].

Constraints:

1 <= nums1.length, nums2.length <= 1000
-1000 <= nums1[i], nums2[i] <= 1000

二、题解

class Solution {
public:vector<vector<int>> findDifference(vector<int>& nums1, vector<int>& nums2) {int n1 = nums1.size();int n2 = nums2.size();vector<int> res1;vector<int> res2;unordered_map<int,int> map1;unordered_map<int,int> map2;for(int i = 0;i < n1;i++) map1[nums1[i]]++;for(int i = 0;i < n2;i++) map2[nums2[i]]++;for(int i = 0;i < n1;i++){if(map2[nums1[i]] == 0){res1.push_back(nums1[i]);map2[nums1[i]]++;}}for(int i = 0;i < n2;i++){if(map1[nums2[i]] == 0){res2.push_back(nums2[i]);map1[nums2[i]]++;}}vector<vector<int>> res;res.push_back(res1);res.push_back(res2);return res;}
};
http://www.lryc.cn/news/211289.html

相关文章:

  • 搭建微信小程序环境及项目结构介绍
  • Python通过pyecharts对爬虫房地产数据进行数据可视化分析(一)
  • 关于测试组件junit切换testng的示例以及切换方式分享
  • nginx 内存管理(二)
  • 【DevChat】智能编程助手 - 使用评测
  • Geek challenge 2023 EzHttp
  • matlabR2021a正版免费使用
  • 天气数据可视化平台-计算机毕业设计vue
  • 揭秘Java switch语句中的case穿透现象
  • Java-API简析_java.io.FilterOutputStream类(基于 Latest JDK)(浅析源码)
  • C语言 每日一题 PTA 10.29 day7
  • 持续集成部署-k8s-服务发现-Ingress 路径匹配与虚拟主机匹配
  • selenium工作原理和反爬分析
  • windows电脑安装系统后固态硬盘和机械硬盘的盘符号顺序显示错乱,解决方法
  • 自定义控件的子控件布局(onLayout()方法)
  • vscode提取扩展出错xhr
  • Docker 笔记(上篇)
  • python自动化测试(六):唯品会商品搜索-练习
  • 深度强化学习用于博弈类游戏-基础测试与说明【1】
  • 通过requests库使用HTTP编写的爬虫程序
  • 550MW发电机变压器组继电保护的整定计算及仿真
  • Linux 命令|服务器相关
  • node 第十三天 express初见
  • Python selenium模块简介
  • DIY相机(一)libcamera库
  • PHP简单实现预定义钩子和自定义钩子
  • 笔记本电脑的摄像头找不到黑屏解决办法
  • 【Git】HEAD detached from xxx 问题及解决方案
  • Cannot connect to the Docker
  • 校园物业报修小程序开发笔记一