LeetCode "Valid Number"

來源:互聯網
上載者:User

標籤:style   blog   color   os   io   for   ar   div   

It took me +20 submissions to get AC... Actually the statement is too vague. I would rather ask for requirements f2f.

Apparently the code below can be simplified..

class Solution {public:    bool isPureNum(string s, int radix)    {                if (s.length() > 1 && s[s.length() - 1] == ‘.‘)        {            s = s.substr(0, s.length() - 1);        }        int i = 0;        while(i < s.length())        {            char c = s[i++];            switch(radix)            {            case 10:                if(!(c >= ‘0‘ && c <= ‘9‘)) return false;                break;            case 16:                if(!((c >= ‘0‘ && c <= ‘9‘) || (c >= ‘a‘ && c <= ‘f‘))) return false;                break;            }        }        return true;    }    bool isFloat(string str)    {        size_t pos = str.find(‘.‘, 0);        string s1 = str.substr(0, pos);        if(s1.find(‘.‘, 0) != string::npos) return false;        string s2 = str.substr(pos + 1, str.length() - pos - 1);        if(s2.find(‘.‘, 0) != string::npos) return false;        if (s1.empty() && s2.empty()) return false;        return isPureNum(s1, 10) &&                 isPureNum(s2, 10);    }    bool isNumber(const char *s) {        int len = strlen(s);        if(len == 0) return false;        //    Trim        int il = 0, ir = len - 1;        while(*(s + il) == ‘ ‘) il ++;        while(*(s + ir) == ‘ ‘) ir --;        if(ir < il) return false;        //    ToLower        string str; str.assign(s + il, s + ir + 1);        std::transform(str.begin(), str.end(), str.begin(), ::tolower);        if(str[0] == ‘-‘ || str[0] == ‘+‘) str = str.substr(1, str.length() - 1);        len = str.length();        char c = str[0];        size_t pos1 = str.find(‘e‘, 0);        if(pos1 != string::npos)        {            //    2e10            string s1 = str.substr(0, pos1);            if(s1.empty()) return false;            if(s1.find(‘e‘, 0) != string::npos) return false;            string s2 = str.substr(pos1 + 1, str.length() - pos1 - 1);            if(s2.find(‘e‘, 0) != string::npos) return false;            if(s2.find(‘.‘, 0) != string::npos) return false;                                if(s2[0] == ‘-‘ ||s2[0] == ‘+‘) s2 = s2.substr(1, s2.length() - 1);            if(s2.empty()) return false;            return (isPureNum(s1, 10) || isFloat(s1)) &&                     isPureNum(s2, 10);        }        else        {            if(isdigit(c))            {                if(len == 1) return true;                if(str[1] == ‘x‘)                {                    if(str[0] == ‘0‘)    return isPureNum(str.substr(2, str.length() - 2), 16);                    else return false;                }                else                {                    size_t pos = str.find(‘.‘, 0);                                if(pos != string::npos)                    {                        //    float                        string s1 = str.substr(0, pos);                        if(s1.find(‘.‘, 0) != string::npos) return false;                        string s2 = str.substr(pos + 1, str.length() - pos - 1);                        if(s2.find(‘.‘, 0) != string::npos) return false;                        if(s2.find(‘+‘, 0) != string::npos) return false;                        if(s2.find(‘-‘, 0) != string::npos) return false;                        if (s1.empty() && s2.empty()) return false;                        return isPureNum(s1, 10) &&                                isPureNum(s2, 10);                    }                    return isPureNum(str, 10);                }            }            else if (c == ‘.‘)    // ".123"            {                string s2 = str.substr(1, str.length() - 1);                if(s2.find(‘.‘, 0) != string::npos) return false;                if(s2.find(‘ ‘, 0) != string::npos) return false;                if(s2.find(‘+‘, 0) != string::npos) return false;                if(s2.find(‘-‘, 0) != string::npos) return false;                return isNumber(s2.c_str());            }        }        return false;    }};

 

聯繫我們

該頁面正文內容均來源於網絡整理,並不代表阿里雲官方的觀點,該頁面所提到的產品和服務也與阿里云無關,如果該頁面內容對您造成了困擾,歡迎寫郵件給我們,收到郵件我們將在5個工作日內處理。

如果您發現本社區中有涉嫌抄襲的內容,歡迎發送郵件至: info-contact@alibabacloud.com 進行舉報並提供相關證據,工作人員會在 5 個工作天內聯絡您,一經查實,本站將立刻刪除涉嫌侵權內容。

A Free Trial That Lets You Build Big!

Start building with 50+ products and up to 12 months usage for Elastic Compute Service

  • Sales Support

    1 on 1 presale consultation

  • After-Sales Support

    24/7 Technical Support 6 Free Tickets per Quarter Faster Response

  • Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.