# LeetCode 0007 - Reverse Integer

## Contents

# Reverse Integer

## Desicription

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

**Example 1:**

1 | Input: 123 |

**Example 2:**

1 | Input: -123 |

**Example 3:**

1 | Input: 120 |

**Note:**

Assume we are dealing with an environment which could only hold integers within the 32-bit signed integer range. For the purpose of this problem, assume that your function returns 0 when the reversed integer overflows.

## Solution

1 | class Solution { |