1 2 3 4 5 6 7 8 9 | bool isNumber(char * s){ char* t=s; while(*t==' '){ ++t; } bool dotAllowed=true; bool eAllowed=false; b[......]<p class="read-more"><a href="https://www.gerrytang.top/?p=904">Read more</a></p> |
LeetCode 1323. Maximum 69 Number
1 2 3 4 5 6 7 8 9 | static auto x = []() { ios::sync_with_stdio(false); cin.tie(nullptr); return 0; }(); class Solution { public: int maximum69N[......]<p class="read-more"><a href="https://www.gerrytang.top/?p=901">Read more</a></p> |