Missing Number LeetCode
class Solution { public int missingNumber(int[] nums) { int n=nums.length; int max=0; int sum=0; for(int i=0;i<n;i++){ sum=sum+nums[i]; if(nums[i]>max){ max=nums[i]; } } int m=max; int min=0; boolean flag=false; for(int i=0;i<n;i++){ if(nums[i]<min){ min=nums[i]; } } for(int i=0;i<n;i++){ if(nums[i]==0){ flag=true; break; } else{ flag=false; } } /*System.out.println(" max digit is: "+max); System.out.println("Tentaive max sum should be: "+(m*(m+1))/2); System.out.println("Sum of series is: "+sum); System.out.println("Missing number is : "+((m