更新代码块

2021-08-10 22:20:48 +08:00
parent c7c34dd824
commit 8a2d42013c
192 changed files with 552 additions and 552 deletions
--- a/problems/0108.将有序数组转换为二叉搜索树.md
+++ b/problems/0108.将有序数组转换为二叉搜索树.md
@@ -122,7 +122,7 @@ return root;

 * 递归整体代码如下：

-```C++
+```CPP
 class Solution {
 private:
    TreeNode* traversal(vector<int>& nums, int left, int right) {
@@ -150,7 +150,7 @@ public:

 模拟的就是不断分割的过程，C++代码如下：（我已经详细注释）

-```C++
+```CPP
 class Solution {
 public:
    TreeNode* sortedArrayToBST(vector<int>& nums) {