leetcode65:有效数字

class Solution {
public:
    bool isNumber(string s) {
        bool flage=false;
        int pose=-1;
        bool flagd=false;
        for(int i=0;i<s.length();i++){
            if((i==0&&(s[i]=='+'||s[i]=='-'))||
            (i==pose+1&&(s[i]=='+'||s[i]=='-'))) continue;
            else if((s[i]>='0'&&s[i]<='9')) continue;
            else if(s[i]=='.'){
                if(flagd||flage) return false;
                flagd = true;
                if(i-1<0&&i+1>=s.length()) return false;
                if(i-1>=0&&(s[i-1]<'0'||s[i-1]>'9')&&i+1<s.length()&&(s[i+1]<'0'||s[i+1]>'9')) return false;
                if(i-1<0&&i+1<s.length()&&(s[i+1]<'0'||s[i+1]>'9')) return false;
                if(i+1>=s.length()&&i-1>=0&&(s[i-1]<'0'||s[i-1]>'9')) return false;
            }
            else if(s[i]=='e'||s[i]=='E'){
                if(flage) return false;
                pose = i;
                flage = true;
                if(i+1>=s.length()||(i+2>=s.length()&&(s[i+1]<'0'||s[i+1]>'9')))  return false;
                if(i-1<0||(i-1>=0&&(s[i-1]=='+'||s[i-1]=='-'))) return false;
            }
            else return false;
        }
        return true;
    }
};