update exercises

data/2.算法中阶/5.leetcode-排序算法/9.315-计算右侧小于当前元素的个数/solution.md

@@ -9,9 +9,9 @@
 <pre>
 <strong>输入：</strong>nums = [5,2,6,1]
 
-<strong>输出：</strong><code>[2,1,1,0] 
+<strong>输出：</strong>[2,1,1,0] 
 
-<strong>解释：</strong></code>
+<strong>解释：</strong>
 </pre>
 
 ```

data/2.算法中阶/6.leetcode-双指针/5.141-环形链表/solution.md

@@ -16,7 +16,7 @@
 
 <p><strong>示例 1：</strong></p>
 
-<p><img alt="" src="https://assets.leetcode-cn.com/aliyun-lc-upload/uploads/2018/12/07/circularlinkedlist.png" style="height: 97px; width: 300px;"></p>
+![](https://assets.leetcode-cn.com/aliyun-lc-upload/uploads/2018/12/07/circularlinkedlist.png)
 
 <pre><strong>输入：</strong>head = [3,2,0,-4], pos = 1