Maximum Number of Achievable Transfer Requests

We have n buildings numbered from 0 to n - 1. Each building has a number of employees. It's transfer season, and some employees want to change the building they reside in.

You are given an array requests where requests[i] = [fromi, toi] represents an employee's request to transfer from building fromi to building toi.

All buildings are full, so a list of requests is achievable only if for each building, the net change in employee transfers is zero. This means the number of employees leaving is equal to the number of employees moving in. For example if n = 3 and two employees are leaving building 0, one is leaving building 1, and one is leaving building 2, there should be two employees moving to building 0, one employee moving to building 1, and one employee moving to building 2.

Return the maximum number of achievable requests.

Example 1:

Input: n = 5, requests = [[0,1],[1,0],[0,1],[1,2],[2,0],[3,4]]
Output: 5
Explantion: Let's see the requests:
From building 0 we have employees x and y and both want to move to building 1.
From building 1 we have employees a and b and they want to move to buildings 2 and 0 respectively.
From building 2 we have employee z and they want to move to building 0.
From building 3 we have employee c and they want to move to building 4.
From building 4 we don't have any requests.
We can achieve the requests of users x and b by swapping their places.
We can achieve the requests of users y, a and z by swapping the places in the 3 buildings.

思路：DFS backtracking, 求所有组合的可能性request最大数目；跟 465. Optimal Account Balancing 很类似；

class Solution {
    public int maximumRequests(int n, int[][] requests) {
        int[] count = new int[n];
        int[] res = new int[]{0};
        dfs(n, requests, res, count, 0, 0);
        return res[0];
    }
    
    private void dfs(int n, int[][] requests, int[] res, int[] count, int index, int pickup) {
        if(index == requests.length) {
            for(int i : count) {
                if(i != 0) {
                    return;
                }
            }
            res[0] = Math.max(res[0], pickup);
            return;
        }
        
        // pick up current request;
        count[requests[index][0]]--;
        count[requests[index][1]]++;
        dfs(n, requests, res, count, index + 1, pickup + 1);
        count[requests[index][1]]--;
        count[requests[index][0]]++;
        
        // Not pick up;
        dfs(n, requests, res, count, index + 1, pickup);
    }
}