[LeetCode] 7. Reverse Integer 翻转整数
Given a 32-bit signed integer, reverse digits of an integer. Example 1: Example 2: Example 3: Note:Assume we are dealing ...
原文：[LeetCode] Integer Replacement 整数替换
Given a positive integernand you can do operations as follow: Ifnis even, replacenwithn . Ifnis odd, you can replacenwith eithern orn . What is the minimum number of replacements needed fornto become ...
2016-09-14 20:57 5 7342 推荐指数：
相关推荐
[LeetCode] 343. Integer Break 整数拆分
Given a positive integer n, break it into the sum of at least two positive integers and maximize the product of those integers. Return the maximum ...
LeetCode 7. 反转整数（Reverse Integer）
题目描述 给定一个 32 位有符号整数，将整数中的数字进行反转。 示例 1: 示例 2: 示例 3: 注意: 假设我们的环境只能存储 32 位有符号整数，其数值范围是 [−231, 231 − 1]。根据这个假设，如果反转后的整数溢出 ...
leetcode：Integer to Roman（整数转化为罗马数字）
Question: Given an integer, convert it to a roman numeral. Input is guaranteed to be within the range from 1 to 3999. 给你一个整数，把它转化为罗马数字，输入保证在1到3999 ...
[LeetCode] 8. String to Integer (atoi) 字符串转为整数
Implement atoi which converts a string to an integer. The function first discards as many whitespace characters as necessary until the first ...
[LeetCode] Integer to English Words 整数转为英文单词
Convert a non-negative integer to its english words representation. Given input is guaranteed to be less than 231 - 1. For example, Hint ...
LeetCode 12. 整数转罗马数字（Integer to Roman）
题目描述 罗马数字包含以下七种字符： I， V， X， L，C，D 和 M。 例如， 罗马数字 2 写做 II ，即为两个并列的 1。12 写做 XII ，即为 X + ...