leetcode-Longest Palindromic Substring

Given a string S, find the longest palindromic substring in S. You may assume that the maximum length of S is 1000, and there exists one unique longest palindromic substring.

class Solution {public:    string longestPalindrome(string s) {        string lString = "";        int lnumber = 0;        int tempnumber;        string tempstring;        int n = s.length();        int i;        if(n <= 1)return s;        for(i = 0;i <n-1;i++)        {            int l = i;            int h = i;            tempnumber = 0;            tempstring = "";            while ((l > -1)&&(h < n)&&(s[l] == s[h]))            {                if(l != h)tempnumber += 2;                else tempnumber++;                l--;                h++;            }           if(lnumber < tempnumber)            {                l++;                h--;                tempstring = s.substr(l, h-l+1);                lnumber = tempnumber;                lString = tempstring;            }                        if(s[i] != s[i+1])continue;            l = i;            h = i+1;            tempnumber = 0;            tempstring = "";            while((l > -1)&&(h < n)&&(s[l] == s[h]))            {                tempnumber += 2;                l--;                h++;            }            if(lnumber < tempnumber)            {                l++;                h--;                tempstring = s.substr(l, h-l+1);                lnumber = tempnumber;                lString = tempstring;            }        }        return lString;    }};