Project Notes

Reverse Integer

3 min read

Nav: << previous: 6.Z 字形变换 | next: 8.字符串转换整数 (atoi) >>

Description

tab: English
 
<p>Given a signed 32-bit integer <code>x</code>, return <code>x</code><em> with its digits reversed</em>. If reversing <code>x</code> causes the value to go outside the signed 32-bit integer range <code>[-2<sup>31</sup>, 2<sup>31</sup> - 1]</code>, then return <code>0</code>.</p>
 
<p><strong>Assume the environment does not allow you to store 64-bit integers (signed or unsigned).</strong></p>
 
<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>
 
<pre>
<strong>Input:</strong> x = 123
<strong>Output:</strong> 321
</pre>
 
<p><strong class="example">Example 2:</strong></p>
 
<pre>
<strong>Input:</strong> x = -123
<strong>Output:</strong> -321
</pre>
 
<p><strong class="example">Example 3:</strong></p>
 
<pre>
<strong>Input:</strong> x = 120
<strong>Output:</strong> 21
</pre>
 
<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>
 
<ul>
	<li><code>-2<sup>31</sup> &lt;= x &lt;= 2<sup>31</sup> - 1</code></li>
</ul>
 
 
 
---
 
[submissions](https://leetcode.com/problems/reverse-integer/submissions/) | [solutions](https://leetcode.com/problems/reverse-integer/solutions/)
 
 
tab: 中文
 
<p>给你一个 32 位的有符号整数 <code>x</code> ，返回将 <code>x</code> 中的数字部分反转后的结果。</p>
 
<p>如果反转后整数超过 32 位的有符号整数的范围 <code>[−2<sup>31</sup>,  2<sup>31 </sup>− 1]</code> ，就返回 0。</p>
<strong>假设环境不允许存储 64 位整数（有符号或无符号）。</strong>
 
<p> </p>
 
<p><strong>示例 1：</strong></p>
 
<pre>
<strong>输入：</strong>x = 123
<strong>输出：</strong>321
</pre>
 
<p><strong>示例 2：</strong></p>
 
<pre>
<strong>输入：</strong>x = -123
<strong>输出：</strong>-321
</pre>
 
<p><strong>示例 3：</strong></p>
 
<pre>
<strong>输入：</strong>x = 120
<strong>输出：</strong>21
</pre>
 
<p><strong>示例 4：</strong></p>
 
<pre>
<strong>输入：</strong>x = 0
<strong>输出：</strong>0
</pre>
 
<p> </p>
 
<p><strong>提示：</strong></p>
 
<ul>
	<li><code>-2<sup>31</sup> <= x <= 2<sup>31</sup> - 1</code></li>
</ul>
 
 
 
---
 
[提交记录](https://leetcode.cn/problems/reverse-integer/submissions/) | [题解](https://leetcode.cn/problems/reverse-integer/solution/)

Solutions & Notes

properties:
  note.updated:
    displayName: Last Updated
  note.relative_links:
    displayName: Related Links
  note.desc:
    displayName: Description
  note.grade:
    displayName: Rating
  note.program_language:
    displayName: Language
  note.time_complexity:
    displayName: TC
  note.space_complexity:
    displayName: SC
views:
  - type: table
    name: Solutions & Notes
    filters:
      and:
        - file.hasLink(this.file)
        - file.tags.containsAny("leetcode/solution", "leetcode/note")
    order:
      - file.name
      - desc
      - program_language
      - time_complexity
      - space_complexity
      - grade
      - relative_links
      - updated
    sort:
      - property: grade
        direction: ASC
      - property: time_complexity
        direction: ASC
      - property: program_language
        direction: ASC
    columnSize:
      file.name: 104
      note.space_complexity: 65
      note.grade: 126

Similar Problems

properties:
  note.lcTopics:
    displayName: Topics
  note.lcAcRate:
    displayName: AC Rate
  note.favorites:
    displayName: Favorites
  note.grade:
    displayName: Rating
  note.translatedTitle:
    displayName: Title (CN)
  note.lcDifficulty:
    displayName: Difficulty
views:
  - type: table
    name: Similar Problems
    filters:
      and:
        - file.hasLink(this.file)
        - similarQuestions.contains(this.file)
    order:
      - file.name
      - translatedTitle
      - lcTopics
      - lcDifficulty
      - lcAcRate
      - grade
      - favorites
    sort:
      - property: file.name
        direction: ASC
      - property: lcTopics
        direction: DESC
    columnSize:
      note.translatedTitle: 240
      note.lcTopics: 347
      note.lcAcRate: 75
      note.grade: 122

Graph View

Backlinks