We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
- Prepare
- Algorithms
- Warmup
- Compare the Triplets
- Discussions
Compare the Triplets
Compare the Triplets
Sort by
recency
|
4189 Discussions
|
Please Login in order to post a comment
Here is my c++ solution, you can watch the explanation here: https://youtu.be/aI9vQg2gO0Q
include
using namespace std; int main(){ int size=3; int sum=0; int var=0; int alice[3]; for(int i=0;i>alice[i]; } int bob[3]; for(int j=0;j>bob[j]; } for(int k=0;kbob[k]){ sum++; } else if(alice[k]
return 0;
}
public static List compareTriplets(List a, Listb){ int alicePoints = 0; int bobPoints = 0; for(int i = 0; i b.get[i]{ alicePoints++; }else if(a.get[i] < b.get[i]){ bobPoints++;
} } List result = new ArrayList<>(); result.add(bobPoints); result.add(bobPoints);
int* compareTriplets(int a_count, int* a, int b_count, int* b, int* result_count) { result_count=2; int result=(int*)malloc(2*sizeof(int)); result[0]=0; result[1]=0; for(int i=0;ib[i]){ result[0]++; } if(b[i]>a[i]){ result[1]++; } } return result; }
int* compareTriplets(int a_count, int* a, int b_count, int* b, int* result_count) { result_count=2; int result=(int*)malloc(2*sizeof(int)); result[0]=0; result[1]=0; for(int i=0;ib[i]){ result[0]++; } if(b[i]>a[i]){ result[1]++; } } return result; }