-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathMatrixMove.java
98 lines (79 loc) · 1.6 KB
/
MatrixMove.java
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
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
import java.util.Scanner;
public class MatrixMove {
public static void main(String[] args) {
Scanner sc=new Scanner(System.in);
int input=sc.nextInt();
String f="yes";
String input1[]=new String[input];
String input2[]=new String[input];
int len=input*input;
int arr1[]=new int[len];
int arr2[]=new int[len];
for(int i=0;i<input;i++)
{
input1[i]=sc.next();
}
for(int i=0;i<input;i++)
{
input2[i]=sc.next();
}
int k=0;
for(int i=0;i<input;i++)
{
String str=input1[i];
//System.out.println("Str--"+str);
String[] str1=str.split("#");
for(String s:str1)
{
int num=Integer.parseInt(s);
//System.out.println("num--"+num);
if(k<len){
arr1[k]=num;
k++;
}
}
}
k=0;
for(int i=0;i<input;i++)
{
String str=input2[i];
String[] str1=str.split("#");
for(String s:str1)
{
int num=Integer.parseInt(s);
if(k<len){
arr2[k]=num;
k++;
}
}
}
if(arr1.length!=arr2.length)
{
f="invalid";
}
for(int i=0;i<len;i++)
{
int val=arr1[i];
boolean flag=false;
for(int j=0;j<len;j++){
if(val==arr2[j])
{
flag=true;
}
}
if(flag==false)
{
f="no";
break;
}
}
//return f;
System.out.println(f);
/*System.out.println("1st array");
for(int i=0;i<len;i++)
System.out.print(arr1[i]+" ");
System.out.println("2nd array");
for(int i=0;i<len;i++)
System.out.print(arr2[i]+" ");*/
}
}