#include <leetcode.h>
◆ maximumRequests()
int leetcode::maximum_number_of_achievable_transfer_requests::Solution::maximumRequests |
( |
int |
n, |
|
|
vector< vector< int > > & |
requests |
|
) |
| |
|
static |
在文件 leetcode.cpp 第 3676 行定义.
3678 for(
unsigned int i = 0; i < 1 << requests.size(); i++) {
3679 auto *in =
new int[n];
3680 auto *out =
new int[n];
3681 memset(in, 0, n *
sizeof(
int));
3682 memset(out, 0, n *
sizeof(
int));
3683 for(
unsigned int j = 0; j < requests.size(); j++) {
3684 if((i & 1 << j) != 0) {
3685 out[requests[j][0]]++;
3686 in[requests[j][1]]++;
3690 for(
int j = 0; j < n; j++) {
3691 if(out[j] != in[j]) {
3697 ans = max(ans, popcount(i));
被这些函数引用 leetcode::maximum_number_of_achievable_transfer_requests::TEST().
该类的文档由以下文件生成: