Find Players With Zero or One Losses

You are given an integer matrix matches where matches[i] = [winner_i, loser_i] indicates that the player winner_i defeated player loser_i 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.

Input Format:

First parameter: matrix matches of numbers

Output Format:

Return the matrix.

Example 1:

Input:
10 2
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:
10 2 represents the size of the matrix.
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:
4 2
2 3
1 3
5 4
6 4
Output: 
1 2 5 6
Explanation:
4 2 represents the size of the matrix.
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 <= 10⁵
• matches[i].length == 2
• 1 <= winner_i, loser_i <= 10⁵
• winner_i != loser_i
• All matches[i] are unique.
• Time complexity: O(n * log⁡ n)
• Space complexity: O(n)