讀處

【原題目】:

Given a 32-bit signed integer, reverse digits of an integer.

Example 1:

Input: 123
Output: 321

Example 2:

Input: -123
Output: -321

Example 3:

Input: 120
Output: 21

Note:
Assume we are dealing with an environment which could only store integers within the 32-bit signed integer range: [−2³¹,  2³¹ − 1]. For the purpose of this problem, assume that your function returns 0 when the reversed integer overflows.

參考 : https://leetcode.com/problems/reverse-integer/

【My Solution】:

先將數字轉為字串做處理，判斷字串的第一個字元是否為負號，接著跑一個for loop將字串的字元依序反轉過來

最後判斷是否有溢位問題，如無則再將字串轉回數字傳回去