680 Valid Palindrome II

  Given a non-empty string s, you may delete at most one character. Judge whether you can make it a palindrome.

Example 1:
Input: "aba"
Output: True
  
  
  public boolean validPalindrome(String s) {
        
     int start= 0 , end = s.length()-1;
     int count1 = 0 , count2 = 0;
     
     while(start<end){
         if(s.charAt(start)==s.charAt(end)){
             start++;
             end--;
         }else{
             start++;
             count1++;
         }
     }
     start = 0 ; end = s.length()-1;
     while(start<end){
         if(s.charAt(start)==s.charAt(end)){
             start++;
             end--;
         }else{
             end--;
             count2++;
         }
     }
        
    if(count1 == 1 || count2 == 1) return true;
    if(count1 == 0 || count2 == 0) return true;
        
    return false;

    }