Add roman-to-integer

Author: beyondyyh

algorithms/README.md

@@ -9,6 +9,7 @@
 |0007|[整数反转](https://leetcode-cn.com/problems/reverse-integer/)|[go](./mystring/7.reverse.go)|S|
 |0008|[字符串转换整数 (atoi)](https://leetcode-cn.com/problems/string-to-integer-atoi/)|[go](./mystring/8.myAtoi.go)|M|
 |0011|[盛最多水的容器](https://leetcode-cn.com/problems/container-with-most-water/submissions/)|[go](./myarray/11.maxArea.go)|M|
+|0013|[罗马数字转整数](https://leetcode-cn.com/problems/roman-to-integer/)|[go](./mystring/13.romanToInt.go)|S|
 |0014|[最长公共前缀](https://leetcode-cn.com/problems/longest-common-prefix/)|[go](./mystring/14.longestCommonPrefix.go)|S|
 |0015|[三数之和](https://leetcode-cn.com/problems/3sum/submissions/)|[go](./myarray/15.threeSum.go)|M|
 |0019|[删除链表的倒数第N个节点](https://leetcode-cn.com/problems/remove-nth-node-from-end-of-list/)|[go](./linkedList/19.removeNthFromEnd.go)|M|
@@ -29,7 +30,6 @@
 |0102|[二叉树的层次遍历](https://leetcode-cn.com/problems/binary-tree-level-order-traversal/submissions/)|[go](./tree/102.levelOrder.go)|M|
 |0103|[二叉树的锯齿形层次遍历](https://leetcode-cn.com/problems/binary-tree-level-order-traversal/submissions/)|[go](./tree/103.zigzagLevelOrder.go)|M|
 |0104|[二叉树的最大深度](https://leetcode-cn.com/problems/maximum-depth-of-binary-tree/)|[go](./tree/104.maxDepth.go)|S|
-|0113|[罗马数字转整数](https://leetcode-cn.com/problems/roman-to-integer/)|[go](./mystring/113.romanToInt.go)|S|
 |0118|[杨辉三角](https://leetcode-cn.com/problems/pascals-triangle/)|[go](./myarray/118.generate.go)|S|
 |0121|[买卖股票的最佳时机](https://leetcode-cn.com/problems/best-time-to-buy-and-sell-stock/)|[go](./myarray/121.maxProfit.go)|S|
 |0136|[只出现一次的数字](https://leetcode-cn.com/problems/single-number/comments/)|[go](./mybit/136.singleNumber.go)|S|