easy java solution 100%
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```\nclass Solution {\n    public int maxSelectedElements(int[] nums) {\n        Arrays.sort(nums);\n        int[]dp=new int[1000001];\n        int res=0;\n        for(int i=0;i<nums.length;i++){\n            dp[nums[i]+1]=dp[nums[i]]+1;\n            dp[nums[i]]=dp[nums[i]-1]+1;            \n            res=Math.max(res,Math.max(dp[nums[i]+1],dp[nums[i]]));\n        }\n        return res;\n    }\n}\n```
['Array', 'Dynamic Programming', 'Sorting', 'Java']