修改了细节

Author: aQua

Algorithms/0226.invert-binary-tree/README.md

@@ -4,7 +4,7 @@
 
 Invert a binary tree.
 
-```shell
+```text
      4
    /   \
   2     7
@@ -14,7 +14,7 @@ Invert a binary tree.
 
 to
 
-```shell
+```text
      4
    /   \
   7     2

Algorithms/0242.valid-anagram/README.md

@@ -6,7 +6,7 @@ Given two strings s and t, write a function to determine if t is an anagram of s
 
 For example,
 
-```shell
+```text
 s = "anagram", t = "nagaram", return true.
 s = "rat", t = "car", return false.
 ```

Algorithms/0273.integer-to-english-words/README.md

@@ -6,7 +6,7 @@ Convert a non-negative integer to its english words representation. Given input
 
 For example,
 
-```shell
+```text
 123 -> "One Hundred Twenty Three"
 12345 -> "Twelve Thousand Three Hundred Forty Five"
 1234567 -> "One Million Two Hundred Thirty Four Thousand Five Hundred Sixty Seven"

Algorithms/0282.expression-add-operators/README.md

@@ -6,7 +6,7 @@ Given a string that contains only digits 0-9 and a target value, return all poss
 
 Examples:
 
-```shell
+```text
 "123", 6 -> ["1+2+3", "1*2*3"]
 "232", 8 -> ["2*3+2", "2+3*2"]
 "105", 5 -> ["1*0+5","10-5"]

Algorithms/0295.find-median-from-data-stream/README.md

@@ -6,7 +6,7 @@ Median is the middle value in an ordered integer list. If the size of the list i
 
 Examples:
 
-```shell
+```text
 [2,3,4] , the median is 3
 [2,3], the median is (2 + 3) / 2 = 2.5
 ```
@@ -18,7 +18,7 @@ Design a data structure that supports the following two operations:
 
 For example:
 
-```shell
+```text
 addNum(1)
 addNum(2)
 findMedian() -> 1.5

Algorithms/0299.bulls-and-cows/README.md

@@ -6,7 +6,7 @@ You are playing the following Bulls and Cows game with your friend: You write do
 
 For example:
 
-```shell
+```text
 Secret number:  "1807"
 Friend's guess: "7810"
 ```
@@ -17,7 +17,7 @@ Write a function to return a hint according to the secret number and friend's gu
 
 Please note that both secret number and friend's guess may contain duplicate digits, for example:
 
-```shell
+```text
 Secret number:  "1123"
 Friend's guess: "0111"
 ```

Algorithms/0301.remove-invalid-parentheses/README.md

@@ -8,7 +8,7 @@ Note: The input string may contain letters other than the parentheses ( and ).
 
 Examples:
 
-```shell
+```text
 "()())()" -> ["()()()", "(())()"]
 "(a)())()" -> ["(a)()()", "(a())()"]
 ")(" -> [""]

Algorithms/0303.range-sum-query-immutable/README.md

@@ -6,7 +6,7 @@ Given an integer array nums, find the sum of the elements between indices i and
 
 Example:
 
-```shell
+```text
 Given nums = [-2, 0, 3, -5, 2, -1]
 
 sumRange(0, 2) -> 1

Algorithms/0304.range-sum-query-2d-immutable/README.md

@@ -10,7 +10,7 @@ The above rectangle (with the red border) is defined by (row1, col1) = (2, 1) an
 
 Example:
 
-```shell
+```text
 Given matrix = [
   [3, 0, 1, 4, 2],
   [5, 6, 3, 2, 1],

Algorithms/0306.additive-number/README.md

@@ -10,13 +10,13 @@ For example:
 
 "112358" is an additive number because the digits can form an additive sequence: 1, 1, 2, 3, 5, 8.
 
-```shell
+```text
 1 + 1 = 2, 1 + 2 = 3, 2 + 3 = 5, 3 + 5 = 8
 ```
 
 "199100199" is also an additive number, the additive sequence is: 1, 99, 100, 199.
 
-```shell
+```text
 1 + 99 = 100, 99 + 100 = 199
 ```
 

Algorithms/0307.range-sum-query-mutable/README.md

@@ -8,7 +8,7 @@ The update(i, val) function modifies nums by updating the element at index i to
 
 Example:
 
-```shell
+```text
 Given nums = [1, 3, 5]
 
 sumRange(0, 2) -> 9

Algorithms/0309.best-time-to-buy-and-sell-stock-with-cooldown/README.md

@@ -12,7 +12,7 @@ Design an algorithm to find the maximum profit. You may complete as many transac
 
 Example:
 
-```shell
+```text
 prices = [1, 2, 3, 0, 2]
 maxProfit = 3
 transactions = [buy, sell, cooldown, buy, sell]

Algorithms/0310.minimum-height-trees/README.md

@@ -14,7 +14,7 @@ You can assume that no duplicate edges will appear in edges. Since all edges are
 
 Example 1:
 
-```shell
+```text
 Given n = 4, edges = [[1, 0], [1, 2], [1, 3]]
 
         0
@@ -28,7 +28,7 @@ return  [1]
 
 Example 2:
 
-```shell
+```text
 Given n = 6, edges = [[0, 3], [1, 3], [2, 3], [4, 3], [5, 4]]
 
      0  1  2

Algorithms/0312.burst-balloons/README.md

@@ -13,7 +13,7 @@ Note:
 
 Example:
 
-```shell
+```text
 Given [3, 1, 5, 8]
 
 Return 167

Algorithms/0315.count-of-smaller-numbers-after-self/README.md

@@ -7,7 +7,7 @@ The counts array has the property where counts[i] is the number of smaller eleme
 
 Example:
 
-```shell
+```text
 Given nums = [5, 2, 6, 1]
 
 To the right of 5 there are 2 smaller elements (2 and 1).

Algorithms/0318.maximum-product-of-word-lengths/README.md

@@ -8,23 +8,23 @@ If no such two words exist, return 0.
 
 Example 1:
 
-```shell
+```text
 Given ["abcw", "baz", "foo", "bar", "xtfn", "abcdef"]
 Return 16
 The two words can be "abcw", "xtfn".
 ```
 
 Example 2:
 
-```shell
+```text
 Given ["a", "ab", "abc", "d", "cd", "bcd", "abcd"]
 Return 4
 The two words can be "ab", "cd".
 ```
 
 Example 3:
 
-```shell
+```text
 Given ["a", "aa", "aaa", "aaaa"]
 Return 0
 No such pair of words.

Algorithms/0319.bulb-switcher/README.md

@@ -8,7 +8,7 @@ Find how many bulbs are on after n rounds.
 
 Example:
 
-```shell
+```text
 Given n = 3.
 
 At first, the three bulbs are [off, off, off].

Algorithms/0322.coin-change/README.md

@@ -6,14 +6,14 @@ You are given coins of different denominations and a total amount of money amoun
 
 Example 1:
 
-```shell
+```text
 coins = [1, 2, 5], amount = 11
 return 3 (11 = 5 + 5 + 1)
 ```
 
 Example 2:
 
-```shell
+```text
 coins = [2], amount = 3
 return -1.
 ```