|
1 |
| -#209. Minimum Size Subarray Sum - LeetCodesolutions inPython/Java/C++ and more |
| 1 | +#209. Minimum Size Subarray Sum - LeetCode Python/Java/C++/JS code |
2 | 2 |
|
3 |
| -Visit original link:[209. Minimum Size Subarray Sum - LeetCodesolutions inPython/Java/C++ and more](https://leetcodepython.com/en/leetcode/209-minimum-size-subarray-sum) for a better experience! |
| 3 | +Visit original link:[209. Minimum Size Subarray Sum - LeetCode Python/Java/C++/JS code](https://leetcodepython.com/en/leetcode/209-minimum-size-subarray-sum) for a better experience! |
4 | 4 |
|
5 | 5 | LeetCode link:[209. Minimum Size Subarray Sum](https://leetcode.com/problems/minimum-size-subarray-sum), difficulty:**Medium**.
|
6 | 6 |
|
@@ -45,7 +45,7 @@ Given an array of positive integers `nums` and a positive integer `target`, retu
|
45 | 45 |
|
46 | 46 | For**subarray** problems, you can consider using**Sliding Window Technique**, which is similar to the**Fast & Slow Pointers Approach**.
|
47 | 47 |
|
48 |
| -##Steps |
| 48 | +##Step by Step Solutions |
49 | 49 |
|
50 | 50 | 1. Iterate over the`nums` array, the`index` of the element is named`fastIndex`. Although inconspicuous, this is the most important logic of the*Fast & Slow Pointers Approach*. Please memorize it.
|
51 | 51 |
|
@@ -296,7 +296,7 @@ public:
|
296 | 296 |
|
297 | 297 | Dear LeetCoders! For a better LeetCode problem-solving experience, please visit website[LeetCodePython.com](https://leetcodepython.com): Dare to claim the best practices of LeetCode solutions! Will save you a lot of time!
|
298 | 298 |
|
299 |
| -Original link:[209. Minimum Size Subarray Sum - LeetCodesolutions inPython/Java/C++ and more](https://leetcodepython.com/en/leetcode/209-minimum-size-subarray-sum). |
| 299 | +Original link:[209. Minimum Size Subarray Sum - LeetCode Python/Java/C++/JS code](https://leetcodepython.com/en/leetcode/209-minimum-size-subarray-sum). |
300 | 300 |
|
301 | 301 | GitHub repository:[f*ck-leetcode](https://github.com/fuck-leetcode/fuck-leetcode).
|
302 | 302 |
|