| 9 | |
| 10 | |
| 11 | class Solution { |
| 12 | public: |
| 13 | int numIdenticalPairs(vector<int>& nums) { |
| 14 | int count=0; |
| 15 | for(int i=0;i<nums.size()-1;++i){ |
| 16 | for(int j=i+1;j<nums.size();++j){ |
| 17 | if(nums[i]==nums[j]){ |
| 18 | count+=1; |
| 19 | } |
| 20 | } |
| 21 | } |
| 22 | |
| 23 | return count; |
| 24 | } |
| 25 | }; |
| 26 | |
| 27 | |
| 28 | // solution 2 |
nothing calls this directly
no outgoing calls
no test coverage detected