Golang学习之路 - LeetCode-Go-Learning 第13题. 罗马数字转整数

鸣谢： LeetCode-In-Go

13. Roman to Integer

题目

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.

来源：力扣（LeetCode）
链接：https://leetcode-cn.com/problems/roman-to-integer
著作权归领扣网络所有。商业转载请联系官方授权，非商业转载请注明出处。

Given a roman numeral, convert it to an integer.

Input is guaranteed to be within the range from 1 to 3999.

解题思路

这一题是12. Integer to Roman的一个逆转换。一样的解题思路

此题，最关键的信息是

右加左减，左减数字必须为一位，比如8写成VIII，而非IIX。

解题思路

1. 从右往左处理字符串。

2. 当前字符代表的数字，小于右边字符的时候，总体减去当前字符代表的数字。

3. 否则，总体加上当前字符代表的数字。

解题代码

方案1

package problem0013

func romanToInt(s string) int {
	res := 0
	m := map[byte]int{
		'I': 1,
		'V': 5,
		'X': 10,
		'L': 50,
		'C': 100,
		'D': 500,
		'M': 1000,
	}

	last := 0
	for i := len(s) - 1; i >= 0; i-- {
		temp := m[s[i]]

		sign := 1
		if temp < last {
			//小数在大数的左边，要减去小数
			sign = -1
		}

		res += sign * temp

		last = temp
	}

	return res
}

方案2

var romanIntMap = map[string]int{
	"I": 1,
	"V": 5,
	"X": 10,
	"L": 50,
	"C": 100,
	"D": 500,
	"M": 1000,
	"IV": 4,
	"IX": 9,
	"XL":40,
	"XC":90,
	"CD":400,
	"CM":900,
}

func romanToInt(s string) int {
	if len(s) <= 0 {
		return 0
	}
	var result int
    // 分离每个字符
	words := strings.Split(s, "")
	for i := 0; i < len(s); i++ {
		if i < len(s) - 1 {
            // 判断两个字符的组合是否是能够查表得到的。如果可以就计算结果
			if v, ok := romanIntMap[words[i] + words[i+1]]; ok {
				result += v
				i++
				continue
			}
		}
		result += romanIntMap[words[i]]
	}
	return result
}

单元测试

package problem0013

import (
	"testing"

	"github.com/stretchr/testify/assert"
)

type question struct {
	para
	ans
}

// para 是参数
// one 代表第一个参数
type para struct {
	one string
}

// ans 是答案
// one 代表第一个答案
type ans struct {
	one int
}

func Test_Problem0013(t *testing.T) {
	ast := assert.New(t)

	qs := []question{
		question{
			para{"XXXIX"},
			ans{39},
		},
		question{
			para{"MDCCCLXXXVIII"},
			ans{1888},
		},
		question{
			para{"MCMLXXVI"},
			ans{1976},
		},
		question{
			para{"MMMCMXCIX"},
			ans{3999},
		},

		// 如需多个测试，可以复制上方元素。
	}

	for _, q := range qs {
		a, p := q.ans, q.para

		ast.Equal(a.one, romanToInt(p.one), "输入:%v", p)
	}
}

总结

抓住关键信息，避免思维定式。