-
Notifications
You must be signed in to change notification settings - Fork 0
/
Solution.java
100 lines (75 loc) · 1.88 KB
/
Solution.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
99
100
import java.util.*;
class Associate
{
private int id;
private String name;
private String technology;
private int exp;
Associate(int id,String name,String technology,int exp)
{
this.id=id;
this.name=name;
this.setTechnology(technology);
this.setExp(exp);
}
public int getExp() {
return exp;
}
public void setExp(int exp) {
this.exp = exp;
}
public String getTechnology() {
return technology;
}
public void setTechnology(String technology) {
this.technology = technology;
}
public int getId() {
return id;
}
public void setId(int id) {
this.id = id;
}
public String getName() {
return name;
}
public void setName(String name) {
this.name = name;
}
}
public class Solution
{
public static void main(String[] args)
{
Scanner sc=new Scanner(System.in);
int n=sc.nextInt();
Associate[] aobj= new Associate[n];
for (int i = 0; i <n; i++)
{
aobj[i]=new Associate(sc.nextInt(),sc.next(), sc.next(),sc.nextInt());
}
String st=sc.next();
sc.close();
Associate res[]=associateTech(aobj,st);
for (int i = 0; i < res.length; i++)
{
System.out.println(res[i].getId());
}
}
static Associate[] associateTech(Associate[] aobj, String st)
{
Associate[] ans= new Associate[0];
for (int i = 0; i < aobj.length; i++)
{
String m=aobj[i].getTechnology();
String m1=m.toLowerCase();
String st1=st.toLowerCase();
if(m1.equals(st1))
{
ans=Arrays.copyOf(ans, ans.length+1);
ans[ans.length-1] = aobj[i];
}
}
return ans;
}
}