style: format code and docs with prettier

Author: yanglbme

solution/1400-1499/1438.Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit/README.md

@@ -1271,7 +1271,7 @@ public:
         deque<int> min_q;
         int n = nums.size();
         int l = 0;
-        
+
         for (int r = 0; r < n; ++r) {
             while (!max_q.empty() && nums[max_q.back()] < nums[r]) {
                 max_q.pop_back();
@@ -1281,7 +1281,7 @@ public:
             }
             max_q.push_back(r);
             min_q.push_back(r);
-            
+
             if (nums[max_q.front()] - nums[min_q.front()] > limit) {
                 ++l;
                 if (max_q.front() < l) {