# [1512. Number of Good Pairs](https://leetcode.com/problems/number-of-good-pairs/)   int numIdenticalPairs(int* nums, int numsSize) { int n=0; for(int i=0;i<numsSize;i++) { for(int j=i+1;j<numsSize;j++) { if(nums[i] == nums[j]) { n++; } } } return n; }
×
Sign in
Email
Password
Forgot password
or
By clicking below, you agree to our
terms of service
.
Sign in via Facebook
Sign in via Twitter
Sign in via GitHub
Sign in via Dropbox
Sign in with Wallet
Wallet (
)
Connect another wallet
New to HackMD?
Sign up