12. Integer to Roman Given an integer, convert it to a roman numeral. Input is guaranteed to be within the range from 1 to 3999. [leetcode] 12. Integer to Roman 13. Roman to Integer Given a roman numeral, convert it to an integer. Input is guaranteed…
Given an integer, write an algorithm to convert it to hexadecimal. For negative integer, two’s complement method is used. Note: All letters in hexadecimal (a-f) must be in lowercase. The hexadecimal string must not contain extra leading 0s. If the nu…
Given a positive integer, return its corresponding column title as appear in an Excel sheet. For example: 1 -> A 2 -> B 3 -> C ... 26 -> Z 27 -> AA 28 -> AB 26进制的实现. 没什么难点.就是需要需要注意是 n = (n-1)/26 public class Solution { public String conv…