slove them

Signed-off-by: megatontech <techme@live.cn>

Author: megatontech

PalindromeNumber.go

@@ -1 +1,23 @@
 package main
+//9. Palindrome Number
+//Easy
+//
+//Determine whether an integer is a palindrome. An integer is a palindrome when it reads the same backward as forward.
+//
+//Example 1:
+//Input: 121
+//Output: true
+//Example 2:
+//Input: -121
+//Output: false
+//Explanation: From left to right, it reads -121. From right to left, it becomes 121-. Therefore it is not a palindrome.
+//Example 3:
+//Input: 10
+//Output: false
+//Explanation: Reads 01 from right to left. Therefore it is not a palindrome.
+//Follow up:
+//
+//Coud you solve it without converting the integer to a string?
+func isPalindrome(x int) bool {
+
+}

ReverseInteger.go

@@ -1 +1,62 @@
 package main
+import (
+	"fmt"
+	"math"
+	"strconv"
+	"strings"
+)
+//7. Reverse Integer
+//Easy
+//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: [−231,  231 − 1].
+//	For the purpose of this problem,
+//assume that your function returns 0 when the reversed integer overflows.
+func reverse(x int) int {
+	return reverse1(x)
+}
+func reverse1(x int) int {
+	//reverse1
+	//整数转字符串
+	var str = strconv.itoa(x)
+	////字符串转整型
+	bytes := []rune(str)
+	for from , to := 0 , len(bytes) -1 ; from < to ; from , to = from + 1, to -1{
+		bytes[from] , bytes[to] = bytes[to] , bytes[from]
+	}
+	str = string(bytes)
+	var result = strconv.Atoi(str)
+	return result
+}
+func reverse2(x int) int {
+	//切割为数组，反转后按幂乘然后相加
+	//var arr = []int
+	var reversearr = []int
+	//strings.Split(strconv.Itoa(x))
+	bytes := []rune(strconv.Itoa(x))
+	for from , to := 0 , len(bytes) -1 ; from < to ; from , to = from + 1, to -1{
+		bytes[from] , bytes[to] = bytes[to] , bytes[from]
+	}
+	for i, i2 := range bytes {
+		reversearr[i] = strconv.Atoi(i2)
+	}
+	var result = 0
+	for i, i2 := range reversearr {
+		result+=i2*math.Pow10(i)
+	}
+	result = (int)result
+	return  result
+}

RomantoInteger.go

@@ -1 +1,45 @@
 package main
+//13. Roman to Integer
+//Easy
+//Roman numerals are represented by seven different symbols: I, V, X, L, C, D and M.
+//Symbol       Value
+//I             1
+//V             5
+//X             10
+//L             50
+//C             100
+//D             500
+//M             1000
+//For example, two is written as II in Roman numeral, just two one's added together. Twelve is written as, XII, which is simply X + II. The number twenty seven is written as XXVII, which is XX + V + II.
+//Roman numerals are usually written largest to smallest from left to right. However, the numeral for four is not IIII. Instead, the number four is written as IV. Because the one is before the five we subtract it making four. The same principle applies to the number nine, which is written as IX. There are six instances where subtraction is used:
+//
+//I can be placed before V (5) and X (10) to make 4 and 9.
+//X can be placed before L (50) and C (100) to make 40 and 90.
+//C can be placed before D (500) and M (1000) to make 400 and 900.
+//Given a roman numeral, convert it to an integer. Input is guaranteed to be within the range from 1 to 3999.
+//
+//Example 1:
+//
+//Input: "III"
+//Output: 3
+//Example 2:
+//
+//Input: "IV"
+//Output: 4
+//Example 3:
+//
+//Input: "IX"
+//Output: 9
+//Example 4:
+//
+//Input: "LVIII"
+//Output: 58
+//Explanation: L = 50, V= 5, III = 3.
+//Example 5:
+//
+//Input: "MCMXCIV"
+//Output: 1994
+//Explanation: M = 1000, CM = 900, XC = 90 and IV = 4.
+func romanToInt(s string) int {
+
+}