Merge pull request #572 from openset/develop

Fix: img link

Author: Shuo

problems/count-primes/README.md

@@ -78,7 +78,7 @@ private boolean isPrime(int num) {
 <p>The <a href="http://en.wikipedia.org/wiki/Sieve_of_Eratosthenes" target="_blank">Sieve of Eratosthenes</a> is one of the most efficient ways to find all prime numbers up to <i>n</i>. But don't let that name scare you, I promise that the concept is surprisingly simple.</p>
 
 <p>
-<img src="/static/images/solutions/Sieve_of_Eratosthenes_animation.gif" /><br />
+<img src="https://assets.leetcode.com/static_assets/public/images/solutions/Sieve_of_Eratosthenes_animation.gif" /><br />
 <small>Sieve of Eratosthenes: algorithm steps for primes below 121. "<a href="http://commons.wikimedia.org/wiki/File:Sieve_of_Eratosthenes_animation.gif" target="_blank">Sieve of Eratosthenes Animation</a>" by <a href="http://de.wikipedia.org/wiki/Benutzer:SKopp" target="_blank">SKopp</a> is licensed under <a href="http://creativecommons.org/licenses/by/2.0/" target="_blank">CC BY 2.0</a>.</small>
 </p>
 

problems/range-sum-query-2d-immutable/README.md

@@ -14,7 +14,7 @@
 <p>Given a 2D matrix <i>matrix</i>, find the sum of the elements inside the rectangle defined by its upper left corner (<i>row</i>1, <i>col</i>1) and lower right corner (<i>row</i>2, <i>col</i>2).</p>
 
 <p>
-<img src="https://assets.leetcode-cn.com/aliyun-lc-upload/original_images/range_sum_query_2d.png" border="0" alt="Range Sum Query 2D" /><br />
+<img src="https://assets.leetcode.com/static_assets/public/images/courses/range_sum_query_2d.png" border="0" alt="Range Sum Query 2D" /><br />
 <small>The above rectangle (with the red border) is defined by (row1, col1) = <b>(2, 1)</b> and (row2, col2) = <b>(4, 3)</b>, which contains sum = <b>8</b>.</small>
 </p>