forked from joharbatta/DataStructure-Java
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathcheckarrsub.java
More file actions
60 lines (47 loc) · 1.13 KB
/
Copy pathcheckarrsub.java
File metadata and controls
60 lines (47 loc) · 1.13 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
import java.util.*;
public class checkarrsub
{
public static void main(String args[])
{
Scanner sc=new Scanner(System.in);
int n=sc.nextInt();
int arr[]=new int[n];
int n1=sc.nextInt();
int arr1[]=new int[n1];
//int n2=sc.nextInt();
//int arr2[]=new int[n2];
for(int i=0;i<n;i++)
{
arr[i]=sc.nextInt();
}
for(int i=0;i<n1;i++)
{
arr1[i]=sc.nextInt();
}
// for(int i=0;i<n2;i++)
// {
// arr2[i]=sc.nextInt();
// }
if(isSubset(arr, arr1, n, n1))
System.out.println("arr2 is a subset of arr1");
else
System.out.println("arr2 is not a subset of arr1");
}
static boolean isSubset(int arr[], int arr1[], int n, int n1)
{
int j=0;
for(int i=0;i<n1;i++)
{
for(j=0;j<n;j++)
{
if(arr1[i]==arr[j])
break;
}
if(j==n)
{
return false;
}
}
return true;
}
}