feat: commit solution

Author: lxlxw

Diff for: README.md

@@ -19,11 +19,11 @@
 
 leetcode 题解，记录自己的 leetcode 解题之路。
 
-**本仓库具有已下特点：**
+**本项目具有如下特点：**
 
 - 可根据题目难易度与题型标签进行`快速索引`。
-- 带有leetcode问题链接的`说明`与`示例`。
-- 包括leetcode`解题思路`和具体的`代码实现`。
+- 包含leetcode问题链接的`说明`与`示例`。
+- 包含leetcode`解题思路`和具体的`代码实现`。
 - 包含单元测试，已提交的问题均已通过leetcode各自的测试用例。
 - 可以直接通过编辑页面实现`Pull requests`。
 

Diff for: _sidebar.md

@@ -1,16 +1,20 @@
 
 - 🏠  速览
   - [项目介绍](README.md  "The greatest guide in the world")
-  - [快速索引](# "按照题型或难易度快速检索题目.")
-    - [题型难度](index-type.md)
-    - [题型标签](index-tags.md)
+  - [快速索引](index-type.md "按照题型或难易度快速检索题目.")
+    - [- 题型难度](index-type.md)
+    - [- 题型标签](index-tags.md)
   - [贡献者列表](contributor.md)
 
 - 📚  题目列表
   - [1.两数之和　✅](solution/1-99/0001.two-sum/)
   - [2.两数相加](solution/1-99/0002.add-two-numbers/)
   - [7.整数反转　✅](solution/1-99/0007.reverse-integer/)
   - [9.回文数　✅](solution/1-99/0009.palindrome-number/)
+  - [13.罗马数字转整数 ✅](solution/1-99/0013.roman-to-integer/)
+  - [20.有效的括号 ✅](solution/1-99/0020.valid-parentheses/)
+  - [26.删除排序数组中的重复项 ✅](solution/1-99/0026.remove-duplicates-from-sorted-array/)
+
 
 
 

Diff for: index-tags.md

@@ -2,43 +2,58 @@
 
 <!-- tabs:start -->
 
-#### **栈**
-
-#### **堆**
-
-#### **排序**
-
-#### **队列**
-
-#### **位运算**
-
-#### **树**
-
 #### **数学**
 
 |  题号  |  题解  |  标签  | 难度  | 是否解题 |
 | --- | --- | --- | --- | --- |
 |  [9](https://leetcode-cn.com/problems/palindrome-number)  |  [回文数](/solution/1-99/0009.palindrome-number/)  |  `数学`  |  <font color=green>简单</font>  |✅ |
 |  [7](https://leetcode-cn.com/problems/reverse-integer)  |  [整数反转](/solution/1-99/0007.reverse-integer/)  |  `数学`  |  <font color=green>简单</font>  |✅ |
+|  [13](https://leetcode-cn.com/problems/roman-to-integer)  |  [罗马数字转整数](/solution/1-99/0013.roman-to-integer/)  |  `数学`,`字符串`  |  <font color=green>简单</font>  |✅ |
 
 #### **字符串**
 
+|  题号  |  题解  |  标签  | 难度  | 是否解题 |
+| --- | --- | --- | --- | --- |
+|  [13](https://leetcode-cn.com/problems/roman-to-integer)  |  [罗马数字转整数](/solution/1-99/0013.roman-to-integer/)  |  `数学`,`字符串`  |  <font color=green>简单</font>  |✅ |
+|  [20](https://leetcode-cn.com/problems/valid-parentheses)  |  [有效的括号](/solution/1-99/0020.valid-parentheses/)  |  `栈`,`字符串`  |  <font color=green>简单</font>  |✅ |
+
 #### **数组**
 
 |  题号  |  题解  |  标签  | 难度  | 是否解题 |
 | --- | --- | --- | --- | --- |
 |  [1](https://leetcode-cn.com/problems/two-sum)  |  [两数之和](/solution/1-99/0001.two-sum/)  |  `数组`,`哈希表`  |  <font color=green>简单</font>  | ✅ |
+|  [26](https://leetcode-cn.com/problems/remove-duplicates-from-sorted-array)  |  [删除排序数组中的重复项](/solution/1-99/0026.remove-duplicates-from-sorted-array/)  |  `数组`,`双指针`  |  <font color=green>简单</font>  |✅ |
 
 #### **哈希表**
 
 |  题号  |  题解  |  标签  | 难度  | 是否解题 |
 | --- | --- | --- | --- | --- |
 |  [1](https://leetcode-cn.com/problems/two-sum)  |  [两数之和](/solution/1-99/0001.two-sum/)  |  `数组`,`哈希表`  |  <font color=green>简单</font>  | ✅ |
 
+#### **栈**
+
+|  题号  |  题解  |  标签  | 难度  | 是否解题 |
+| --- | --- | --- | --- | --- |
+|  [20](https://leetcode-cn.com/problems/valid-parentheses)  |  [有效的括号](/solution/1-99/0020.valid-parentheses/)  |  `栈`,`字符串`  |  <font color=green>简单</font>  |✅ |
+
+#### **堆**
+
+#### **排序**
+
+#### **队列**
+
+#### **位运算**
+
+#### **树**
+
 #### **二分查找**
 
 #### **双指针**
 
+|  题号  |  题解  |  标签  | 难度  | 是否解题 |
+| --- | --- | --- | --- | --- |
+|  [26](https://leetcode-cn.com/problems/remove-duplicates-from-sorted-array)  |  [删除排序数组中的重复项](/solution/1-99/0026.remove-duplicates-from-sorted-array/)  |  `数组`,`双指针`  |  <font color=green>简单</font>  |✅ |
+
 #### **递归**
 
 #### **深度优先搜素**

Diff for: index-type.md

@@ -10,11 +10,11 @@
 |  [1](https://leetcode-cn.com/problems/two-sum)  |  [两数之和](/solution/1-99/0001.two-sum/)  |  `数组`,`哈希表`  |  <font color=green>简单</font>  | ✅ |
 |  [7](https://leetcode-cn.com/problems/reverse-integer)  |  [整数反转](/solution/1-99/0007.reverse-integer/)  |  `数学`  |  <font color=green>简单</font>  |✅ |
 |  [9](https://leetcode-cn.com/problems/palindrome-number)  |  [回文数](/solution/1-99/0009.palindrome-number/)  |  `数学`  |  <font color=green>简单</font>  |✅ |
-|  [13](https://leetcode-cn.com/problems/roman-to-integer)  |  [罗马数字转整数](/solution/1-99/0013.roman-to-integer/)  |  `数学`,`字符串`  |  <font color=green>简单</font>  |
+|  [13](https://leetcode-cn.com/problems/roman-to-integer)  |  [罗马数字转整数](/solution/1-99/0013.roman-to-integer/)  |  `数学`,`字符串`  |  <font color=green>简单</font>  |✅ |
 |  [14](https://leetcode-cn.com/problems/longest-common-prefix)  |  [最长公共前缀](/solution/1-99/0014.longest-common-prefix/)  |  `字符串`  |  <font color=green>简单</font>  |
-|  [20](https://leetcode-cn.com/problems/valid-parentheses)  |  [有效的括号](/solution/1-99/0020.valid-parentheses/)  |  `栈`,`字符串`  |  <font color=green>简单</font>  |
+|  [20](https://leetcode-cn.com/problems/valid-parentheses)  |  [有效的括号](/solution/1-99/0020.valid-parentheses/)  |  `栈`,`字符串`  |  <font color=green>简单</font>  |✅ |
 |  [21](https://leetcode-cn.com/problems/merge-two-sorted-lists)  |  [合并两个有序链表](/solution/1-99/0021.merge-two-sorted-lists/)  |  `链表`  |  <font color=green>简单</font>  |
-|  [26](https://leetcode-cn.com/problems/remove-duplicates-from-sorted-array)  |  [删除排序数组中的重复项](/solution/1-99/0026.remove-duplicates-from-sorted-array/)  |  `数组`,`双指针`  |  <font color=green>简单</font>  |
+|  [26](https://leetcode-cn.com/problems/remove-duplicates-from-sorted-array)  |  [删除排序数组中的重复项](/solution/1-99/0026.remove-duplicates-from-sorted-array/)  |  `数组`,`双指针`  |  <font color=green>简单</font>  |✅ |
 |  [27](https://leetcode-cn.com/problems/remove-element)  |  [移除元素](/solution/1-99/0027.remove-element/)  |  `数组`,`双指针`  |  <font color=green>简单</font>  |
 |  [28](https://leetcode-cn.com/problems/implement-strstr)  |  [实现 strstr()](/solution/1-99/0028.implement-strstr%28%29/)  |  `双指针`,`字符串`  |  <font color=green>简单</font>  |
 |  [35](https://leetcode-cn.com/problems/search-insert-position)  |  [搜索插入位置](/solution/1-99/0035.search-insert-position/)  |  `数组`,`二分查找`  |  <font color=green>简单</font>  |

Diff for: solution/1-99/0013.roman-to-integer/README.md

@@ -0,0 +1,116 @@
+# [13.罗马数字转整数](https://leetcode-cn.com/problems/palindrome-number)
+
+
+### 题目描述
+
+<div class="notranslate"><p>罗马数字包含以下七种字符:&nbsp;<code>I</code>，&nbsp;<code>V</code>，&nbsp;<code>X</code>，&nbsp;<code>L</code>，<code>C</code>，<code>D</code>&nbsp;和&nbsp;<code>M</code>。</p>
+
+<pre><strong>字符</strong>          <strong>数值</strong>
+I             1
+V             5
+X             10
+L             50
+C             100
+D             500
+M             1000</pre>
+
+<p>例如， 罗马数字 2 写做&nbsp;<code>II</code>&nbsp;，即为两个并列的 1。12 写做&nbsp;<code>XII</code>&nbsp;，即为&nbsp;<code>X</code>&nbsp;+&nbsp;<code>II</code>&nbsp;。 27 写做&nbsp;&nbsp;<code>XXVII</code>, 即为&nbsp;<code>XX</code>&nbsp;+&nbsp;<code>V</code>&nbsp;+&nbsp;<code>II</code>&nbsp;。</p>
+
+<p>通常情况下，罗马数字中小的数字在大的数字的右边。但也存在特例，例如 4 不写做&nbsp;<code>IIII</code>，而是&nbsp;<code>IV</code>。数字 1 在数字 5 的左边，所表示的数等于大数 5 减小数 1 得到的数值 4 。同样地，数字 9 表示为&nbsp;<code>IX</code>。这个特殊的规则只适用于以下六种情况：</p>
+
+<ul>
+	<li><code>I</code>&nbsp;可以放在&nbsp;<code>V</code>&nbsp;(5) 和&nbsp;<code>X</code>&nbsp;(10) 的左边，来表示 4 和 9。</li>
+	<li><code>X</code>&nbsp;可以放在&nbsp;<code>L</code>&nbsp;(50) 和&nbsp;<code>C</code>&nbsp;(100) 的左边，来表示 40 和&nbsp;90。&nbsp;</li>
+	<li><code>C</code>&nbsp;可以放在&nbsp;<code>D</code>&nbsp;(500) 和&nbsp;<code>M</code>&nbsp;(1000) 的左边，来表示&nbsp;400 和&nbsp;900。</li>
+</ul>
+
+<p>给定一个罗马数字，将其转换成整数。输入确保在 1&nbsp;到 3999 的范围内。</p>
+
+<p><strong>示例&nbsp;1:</strong></p>
+
+<pre><strong>输入:</strong>&nbsp;"III"
+<strong>输出:</strong> 3</pre>
+
+<p><strong>示例&nbsp;2:</strong></p>
+
+<pre><strong>输入:</strong>&nbsp;"IV"
+<strong>输出:</strong> 4</pre>
+
+<p><strong>示例&nbsp;3:</strong></p>
+
+<pre><strong>输入:</strong>&nbsp;"IX"
+<strong>输出:</strong> 9</pre>
+
+<p><strong>示例&nbsp;4:</strong></p>
+
+<pre><strong>输入:</strong>&nbsp;"LVIII"
+<strong>输出:</strong> 58
+<strong>解释:</strong> L = 50, V= 5, III = 3.
+</pre>
+
+<p><strong>示例&nbsp;5:</strong></p>
+
+<pre><strong>输入:</strong>&nbsp;"MCMXCIV"
+<strong>输出:</strong> 1994
+<strong>解释:</strong> M = 1000, CM = 900, XC = 90, IV = 4.</pre>
+</div>
+
+
+### 解题思路
+
+1. 先匹配特殊的字符串,匹配到的话`ret`累加
+2. 遍历字符串,如果能在`romanMap`中找到的话`ret`累加
+
+?> 该题解不是最优解！
+
+### 代码实现
+
+<!-- tabs:start -->
+
+#### **Golang**
+```go
+import (
+	"strconv"
+	"strings"
+)
+
+func romanToInt(s string) int {
+	romanMap := map[string]int{
+		"I": 1,
+		"V": 5,
+		"X": 10,
+		"L": 50,
+		"C": 100,
+		"D": 500,
+		"M": 1000,
+	}
+	romanManyMap := map[string]int{
+		"IV": 4,
+		"IX": 9,
+		"XL": 40,
+		"XC": 90,
+		"CD": 400,
+		"CM": 900,
+	}
+	var ret int
+	for k, v := range romanManyMap {
+		if strings.Contains(s, k) {
+			s = strings.Replace(s, k, strconv.Itoa(v), -1)
+			ret += v
+		}
+	}
+	for k := range s {
+		if romanMap[s[k:k+1]] != 0 {
+			ret += romanMap[s[k:k+1]]
+		}
+	}
+	return ret
+}
+```
+#### **Java**
+
+#### **Python**
+
+#### **PHP**
+
+<!-- tabs:end -->

Diff for: solution/1-99/0013.roman-to-integer/solution.go

@@ -0,0 +1,39 @@
+package leetcode
+
+import (
+	"strconv"
+	"strings"
+)
+
+func romanToInt(s string) int {
+	romanMap := map[string]int{
+		"I": 1,
+		"V": 5,
+		"X": 10,
+		"L": 50,
+		"C": 100,
+		"D": 500,
+		"M": 1000,
+	}
+	romanManyMap := map[string]int{
+		"IV": 4,
+		"IX": 9,
+		"XL": 40,
+		"XC": 90,
+		"CD": 400,
+		"CM": 900,
+	}
+	var ret int
+	for k, v := range romanManyMap {
+		if strings.Contains(s, k) {
+			s = strings.Replace(s, k, strconv.Itoa(v), -1)
+			ret += v
+		}
+	}
+	for k := range s {
+		if romanMap[s[k:k+1]] != 0 {
+			ret += romanMap[s[k:k+1]]
+		}
+	}
+	return ret
+}

Diff for: solution/1-99/0013.roman-to-integer/solution_test.go

@@ -0,0 +1,46 @@
+package leetcode
+
+import (
+	"fmt"
+	"testing"
+)
+
+func TestRomanToInt(t *testing.T) {
+
+	var s string
+	var ret int
+	s = "III"
+	ret = 3
+	fmt.Printf("x = %v ret = %v\n", s, romanToInt(s))
+	if romanToInt(s) != ret {
+		t.Fatalf("case fails: %v\n", ret)
+	}
+
+	s = "IV"
+	ret = 4
+	fmt.Printf("x = %v ret = %v\n", s, romanToInt(s))
+	if romanToInt(s) != ret {
+		t.Fatalf("case fails: %v\n", ret)
+	}
+
+	s = "IX"
+	ret = 9
+	fmt.Printf("x = %v ret = %v\n", s, romanToInt(s))
+	if romanToInt(s) != ret {
+		t.Fatalf("case fails: %v\n", ret)
+	}
+
+	s = "LVIII"
+	ret = 58
+	fmt.Printf("x = %v ret = %v\n", s, romanToInt(s))
+	if romanToInt(s) != ret {
+		t.Fatalf("case fails: %v\n", ret)
+	}
+
+	s = "MCMXCIV"
+	ret = 1994
+	fmt.Printf("x = %v ret = %v\n", s, romanToInt(s))
+	if romanToInt(s) != ret {
+		t.Fatalf("case fails: %v\n", ret)
+	}
+}