if we use this approach time complexity is high?

public int numGoodPairs(int[] nums) {
    int pairCount = 0;
    // TODO: Write your code here
    for(int i=0; i<nums.length; i++){
      for (int j=i+1; j<nums.length; j++){
        if (nums[i]== nums[j]){
          pairCount++;
        }
      }
    }
    return pairCount;
  }