update readme

Author: hogan-tech

.github/test.txt

@@ -1,2 +1 @@
-3321-find-x-sum-of-all-k-long-subarrays-ii python hard
-2528-maximize-the-minimum-powered-city python hard
+0339-nested-list-weight-sum python medium

0339-nested-list-weight-sum/0339-nested-list-weight-sum.py renamed to Python/0339-nested-list-weight-sum.py

@@ -276,6 +276,7 @@
 | 0334 | [Increasing Triplet Subsequence](https://leetcode.com/problems/increasing-triplet-subsequence/)                                                          | [Python](./Python/0334-increasing-triplet-subsequence.py)                                                                                 | [Medium](./Readme/0334-increasing-triplet-subsequence.md)                              |
 | 0337 | [House Robber III](https://leetcode.com/problems/house-robber-iii)                                                                                       | [Python](./Python/0337-house-robber-iii.py)                                                                                               | [Medium](./Readme/0337-house-robber-iii.md)                                            |
 | 0338 | [Counting Bits](https://leetcode.com/problems/counting-bits/)                                                                                            | [Python](./Python/0338-counting-bits.py)                                                                                                  | [Medium](./Readme/0338-counting-bits.md)                                               |
+| 0339 | [Nested List Weight Sum](https://leetcode.com/problems/nested-list-weight-sum/)                                                                          | [Python](./Python/0339-nested-list-weight-sum.py)                                                                                         | [Medium](./Readme/0339-nested-list-weight-sum.md)                                      |
 | 0340 | [Longest Substring with At Most K Distinct Characters](https://leetcode.com/problems/longest-substring-with-at-most-k-distinct-characters/)              | [Python](./Python/0340-longest-substring-with-at-most-k-distinct-characters.py)                                                           | [Medium](./Readme/0340-longest-substring-with-at-most-k-distinct-characters.md)        |
 | 0341 | [Flatten Nested List Iterator](https://leetcode.com/problems/flatten-nested-list-iterator/)                                                              | [Python](./Python/0341-flatten-nested-list-iterator.py)                                                                                   | [Medium](./Readme/0341-flatten-nested-list-iterator.md)                                |
 | 0342 | [Power of Four](https://leetcode.com/problems/power-of-four/)                                                                                            | [Python](./Python/0342-power-of-four.py)                                                                                                  | [Easy](./Readme/0342-power-of-four.md)                                                 |