leetcode刷题_验证回文字符串 Ⅱ

题目描述

Java解决方法 

class Solution {
    public boolean Palindrome(String s, int start, int end)
    {
        while(start < end)
        {
            if(s.charAt(start) == s.charAt(end))
            {
                start++;
                end--;
            }
            else
            {
                return false;
            }
        }
        return true;
    }

    public boolean validPalindrome(String s) {
        int start = 0;
        int end = s.length() - 1;
        while(start < end)
        {
            if(s.charAt(start) == s.charAt(end))
            {
                start++;
                end--;
            }
            else
            {
                break;
            }
        }
        if(start >= end)
        {
            return true;
        }
        else
        {
            boolean valid1 = Palindrome(s, start + 1, end);
            boolean valid2 = Palindrome(s, start, end - 1);
            if(valid1 || valid2)
            {
                return true;
            }
            else
            {
                return false;
            }
        }
    }
}

 

C解决方法

bool Palindrome(char * s, int start, int end)
{
    while(start < end)
        {
            if(s[start] == s[end])
            {
                start++;
                end--;
            }
            else
            {
                return false;
            }
        }
        return true;
}

bool validPalindrome(char * s){
    bool valid1;
    bool valid2;
    int start = 0;
    int end = strlen(s) - 1;
    while(start < end)
    {
        if(s[start] == s[end])
        {
            start++;
            end--;
        }
        else
        {
            break;
        }
    }
    if(start >= end)
    {
        return true;
    }
    else
    {
        valid1 = Palindrome(s, start + 1, end);
        valid2 = Palindrome(s, start, end - 1);
        if(valid1 || valid2)
        {
            return true;
        }
        else
        {
            return false;
        }
    }
}