diff options
author | Jack Sangdahl <[email protected]> | 2025-06-27 12:23:02 -0600 |
---|---|---|
committer | Jack Sangdahl <[email protected]> | 2025-06-27 12:23:02 -0600 |
commit | a96b65cbfad7f62f3db6b2eab105e4e25c0414c5 (patch) | |
tree | e2a2b3f49f9fb741be81415266ac93e74cff42ec /other/largest_odd_num_string.cpp | |
parent | 694ad5ed71edcb1deccab54b72d706b779918276 (diff) | |
download | leetcode-a96b65cbfad7f62f3db6b2eab105e4e25c0414c5.tar.gz leetcode-a96b65cbfad7f62f3db6b2eab105e4e25c0414c5.zip |
chore: remove old cpp and rust solutions
Diffstat (limited to 'other/largest_odd_num_string.cpp')
-rw-r--r-- | other/largest_odd_num_string.cpp | 28 |
1 files changed, 0 insertions, 28 deletions
diff --git a/other/largest_odd_num_string.cpp b/other/largest_odd_num_string.cpp deleted file mode 100644 index 019d609..0000000 --- a/other/largest_odd_num_string.cpp +++ /dev/null @@ -1,28 +0,0 @@ -#include "leetcode.h" - -class Solution { -public: - string largestOddNumber(string num) { - if (num.back() == '0') - num.pop_back(); - int back = stoi(num) % 10; - if (back % 2 == 0) { - for (int i = 0; i < num.size(); i++) - if (num[i] % 2 == 0) - num.erase(i, 1), i--; - if (num.size() < 2) - return num; - else - for (int i = 0; i < num.size(); i++) - if (num[i] < num[i + 1]) - return num.substr(i + 2, 1); - } else - return num; - return string(); - } -}; - -int main() { - Solution obj; - cout << endl << obj.largestOddNumber("10133890"); -} |