update 0013

Author: xiyou

Algorithms/0013.roman_to_integer/roman_to_integer.rs

@@ -1,31 +1,51 @@
-package problem0013
+pub struct Solution {}
 
-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,
-	}
+fn transform(s: &str) -> i32 {
+    match s {
+        "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,
+        _ => 0,
+    }
+}
+
+impl Solution {
+    pub fn roman_to_int(s: String) -> i32 {
+        let s_length = s.len();
+        let mut i = 0;
+        let mut result = 0;
 
-	last := 0
-	for i := len(s) - 1; i >= 0; i-- {
-		temp := m[s[i]]
+        while i < s_length {
+            let ostr = s.chars().nth(i).unwrap().to_string();
+            let mut nstr = String::from("");
 
-		sign := 1
-		if temp < last {
-			//小数在大数的左边，要减去小数
-			sign = -1
-		}
+            i += 1;
+            if i < s_length {
+                let nchar = s.chars().nth(i).unwrap();
+                nstr.push_str(&ostr);
+                nstr.push(nchar);
 
-		res += sign * temp
+                let val = transform(&nstr);
+                if val != 0 {
+                    result += val;
+                    i += 1;
+                    continue;
+                }
+            };
 
-		last = temp
-	}
+            result += transform(&ostr);
+        }
 
-	return res
+        return result;
+    }
 }

Algorithms/0013.roman_to_integer/roman_to_integer_test.rs

@@ -1,55 +1,7 @@
-package problem0013
+mod roman_to_integer;
+use roman_to_integer::Solution;
 
-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)
-	}
+fn main() {
+    let results = Solution::roman_to_int("MCMXCIV".to_owned());
+    println!("{:?}", results);
 }

README.md

@@ -16,4 +16,5 @@ leetcode in rust lang.
 |1|[Two Sum](./Algorithms/0001.two_sum)|39%|Easy||
 |2|[Add Two Numbers](./Algorithms/0002.add_two_numbers)|29%|Medium||
 |3|[Longest Substring Without Repeating Characters](./Algorithms/0003.longest_substring_without_repeating_characters)|25%|Medium||
-|4|[Median of Two Sorted Arrays](./Algorithms/0004.median_of_two_sorted_arrays)|24%|Hard||
+|4|[Median of Two Sorted Arrays](./Algorithms/0004.median_of_two_sorted_arrays)|24%|Hard||
+|13|[Roman to Integer](./Algorithms/0013.roman_to_integer)|24%|Easy||