The Solution for Beignners 🫰🫰
Code\n\nclass Solution {\n    public int countPairs(List<Integer> nums, int target) {\n        int res=0;\n        for(int i=0;i<nums.size();i++)\n            f
# Code\n```\nclass Solution {\n    public int countPairs(List<Integer> nums, int target) {\n        int res=0;\n        for(int i=0;i<nums.size();i++)\n            for(int j=i+1;j<nums.size();j++)\n                if(nums.get(i)+nums.get(j)<target) res++;\n        return res;\n    }\n}\n```
['Java']