Two Files（牛客14330）

最新推荐文章于 2024-09-16 20:08:29 发布

尘～容

最新推荐文章于 2024-09-16 20:08:29 发布

阅读量432

点赞数

文章标签： java 算法

本文链接：https://blog.csdn.net/C1hacker/article/details/106057630

版权

链接：https://ac.nowcoder.com/acm/problem/14330
来源：牛客网

题目描述
Small W gets two files. There are n integers in each file. Small W wants to know whether these two files are same. So he invites you to write a program to check whether these two files are same. Small W thinks that two files are same when they have the same integer set.
For example file A contains (5,3,7,7),and file B contains (7,5,3,3). They have the same integer set (3,5,7), so they are same.
Another sample file C contains(2,5,2,5), and file D contains (2,5,2,3).
The integer set of C is (2,5),but the integer set of D is (2,3,5),so they are not same.
Now you are expected to write a program to compare two files with size of n.
输入描述:
Multi test cases . Each case contain three lines. The first line contains one integer n represents the size of file. The second line contains n integers a1,a2,a3,…,an - represents the content of the first file. The third line contains n integers b1,b2,b3,…,bn - represents the content of the second file.
Process to the end of file.
1≤n≤1000000
1≤ai,bi≤1000000000
输出描述:
For each case, output “YES” (without quote) if these two files are same, otherwise output “NO” (without quote).
示例1

输入
5
1 2 1 2 3
1 3 3 2 2
3
1 2 3
1 1 2

输出
YES
NO

代码

import java.util.*;
public class Main {
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);    
      while(in.hasNext()) {
    	  int n=in.nextInt();
    	  int []a=new int [n];
    	  int []b=new int [n];
    	 for(int i=0;i<n;i++) {
    		 a[i]=in.nextInt();
    	 }
    	 Arrays.sort(a);
    	 for(int i=0;i<n;i++) {
    		 b[i]=in.nextInt();
    	 }
    	 Arrays.sort(b);
    	 int i=0,j=0;
         while(i<n&&j<n){
             if(a[i]!=b[i])
                 break;
             i++;
             j++;
             while(i<n&&a[i]==a[i-1])
                 i++;
             while(j<n&&b[j]==b[j-1])
                 j++;
         }
         if(i==n&&j==n)
        	 System.out.println("YES");
         else
        	 System.out.println("NO");
      }
    	    }
}