Java | using array
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \n\n# Complexity\n- Time 
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\n\n# Complexity\n- Time complexity:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\n\nclass Solution {\n    public int maxCount(int[] banned, int n, int maxSum) {\n        int res=0;\n        int sum=0;\n        int a[]=new int[100001];\n        for(int i:banned)a[i]++;\n        for(int i=1;i<=n;i++)\n        {\n            if(a[i]==0&&(i+sum)<=maxSum){\n                res++;\n                sum+=i;\n            }\n        }\n        return res;   \n    }\n          \n}\n```
['Java']