2563.Count pairs whose sum is less than target.JAVA

class Solution {
    public int countPairs(List<Integer> nums, int target) {
     int ans = 0;
     int n = nums.size();
     for(int i = 0; i < n - 1; i++){
         for(int j = i + 1; j < n; j++){
             if(nums.get(i) + nums.get(j) < target){
                 ans = ans + 1;
             }
         }
     } 
     return ans;  
    }
}