-
Notifications
You must be signed in to change notification settings - Fork 3
/
Copy pathFindPlayersWithZeroOrOneLosses2225.kt
70 lines (58 loc) · 2.11 KB
/
FindPlayersWithZeroOrOneLosses2225.kt
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
package medium
/**
* You are given an integer array matches where matches[i] = [winneri, loseri] indicates that the player winneri defeated player loseri in a match.
Return a list answer of size 2 where:
answer[0] is a list of all players that have not lost any matches.
answer[1] is a list of all players that have lost exactly one match.
The values in the two lists should be returned in increasing order.
Note:
You should only consider the players that have played at least one match.
The testcases will be generated such that no two matches will have the same outcome.
Example 1:
Input: matches = [[1,3],[2,3],[3,6],[5,6],[5,7],[4,5],[4,8],[4,9],[10,4],[10,9]]
Output: [[1,2,10],[4,5,7,8]]
Explanation:
Players 1, 2, and 10 have not lost any matches.
Players 4, 5, 7, and 8 each have lost one match.
Players 3, 6, and 9 each have lost two matches.
Thus, answer[0] = [1,2,10] and answer[1] = [4,5,7,8].
Example 2:
Input: matches = [[2,3],[1,3],[5,4],[6,4]]
Output: [[1,2,5,6],[]]
Explanation:
Players 1, 2, 5, and 6 have not lost any matches.
Players 3 and 4 each have lost two matches.
Thus, answer[0] = [1,2,5,6] and answer[1] = [].
Constraints:
1 <= matches.length <= 105
matches[i].length == 2
1 <= winneri, loseri <= 105
winneri != loseri
All matches[i] are unique.
*/
fun findWinners(matches: Array<IntArray>): List<List<Int>> {
val zeroLose = mutableSetOf<Int>()
val onesLose = mutableSetOf<Int>()
val manyLose = mutableSetOf<Int>()
for (match in matches) {
val winner = match[0]
val loser = match[1]
// Add winner first
if (!onesLose.contains(winner) && !manyLose.contains(winner))
zeroLose.add(winner)
if (zeroLose.contains(loser)) {
zeroLose.remove(loser)
onesLose.add(loser)
} else if (onesLose.contains(loser)) {
onesLose.remove(loser)
manyLose.add(loser)
} else if (manyLose.contains(loser))
continue
else
onesLose.add(loser)
}
val result = mutableListOf<List<Int>>()
result.add(zeroLose.sorted())
result.add(onesLose.sorted())
return result
}