250x250
반응형
Notice
Recent Posts
Recent Comments
Link
N
(Leet Code c++)Reverse Integer 본문
728x90
반응형
7. Reverse Integer
Given a signed 32-bit integer x, return x with its digits reversed. If reversing x causes the value to go outside the signed 32-bit integer range [-231, 231 - 1], then return 0.
Assume the environment does not allow you to store 64-bit integers (signed or unsigned).
Example 1:
Input: x = 123 Output: 321
Example 2:
Input: x = -123 Output: -321
Example 3:
Input: x = 120 Output: 21
Example 4:
Input: x = 0 Output: 0
Constraints:
- -231 <= x <= 231 - 1
class Solution {
public:
int reverse(int x) {
int answer = 0;
while(x != 0){
int remain = x % 10;
x /= 10;
if(answer > INT_MAX / 10 || (answer == INT_MAX / 10 && remain > 7)){
return 0;
}
if(answer < INT_MIN / 10 || (answer == INT_MIN / 10 && remain < -8)){
return 0;
}
answer = answer * 10 + remain;
}
return answer;
}
};
728x90
반응형
'Leet Code 알고리즘' 카테고리의 다른 글
(Leet Code c++)Palindrome Number (0) | 2021.07.06 |
---|---|
(Leet Code c++)ZigZag Conversion (0) | 2021.07.05 |
(Leet Code c++)Longest Palindromic Substring (0) | 2021.07.05 |
(Leet Code c++)Median of Two Sorted Arrays (0) | 2021.07.01 |
(Leet Code c++)Longest Substring Without Repeating Characters (0) | 2021.07.01 |