Perfected some code to use int to make it more readable.

gazeldx · gazeldx · commit dd24456f27c4 · 2024-12-12T13:19:53.000+08:00
diff --git a/README.md b/README.md
@@ -1,21 +1,17 @@
 # A best practice for the LeetCode problems
 There are more than 3300 questions on LeetCode. If you do it without any choice, **you won't have that much time**.
-
 **You often find that you can't do the questions you did last time.** This is because you haven't mastered the problem-solving patterns.
-
 When you use several common problem-solving patterns to solve problems, you find that your problem-solving ability has risen to a new level.
 
 Here, I will provide you with **common problem-solving patterns** so that you don't waste time on questions that are not often tested in interviews.
 
 I will also provide you with solutions for many common programming languages, such as **Python, C++, Java, JavaScript, C#, Go, Ruby**, etc.
-
 I have tried my best to write the most concise and efficient code, so I call it my best practice. If you have better solutions, welcome to create an issue or PR!
 
 ## How to use this repo?
 I have planned a learning route for you. You just need to do the questions in the order they are listed.
 
 Generally speaking, the simple questions are placed at the front, and the dependencies between the questions are also considered reasonably.
-
 After finishing one category of questions, you can study another category to improve your sense of achievement and learning speed.
 
 # Brute Force
diff --git a/problems/0084-largest-rectangle-in-histogram.md b/problems/0084-largest-rectangle-in-histogram.md
@@ -105,7 +105,7 @@ class Solution {
 public:
     int largestRectangleArea(vector<int> heights) {
         heights.insert(heights.begin(), 0);
-        heights.emplace_back(0);
+        heights.push_back(0);
         auto max_area = 0;
         stack<int> index_stack;
 
diff --git a/problems/0509-fibonacci-number.md b/problems/0509-fibonacci-number.md
@@ -162,21 +162,22 @@ class Solution:
 ### Solution 1: Recursion
 ```cpp
 class Solution {
-    unordered_map<int, int> num_to_fib_num;
+private:
+    unordered_map<int, int> num_to_fib_num_;
 
 public:
     int fib(int n) {
         if (n <= 1) {
             return n;
         }
 
-        if (num_to_fib_num.contains(n)) {
-            return num_to_fib_num[n];
+        if (num_to_fib_num_.contains(n)) {
+            return num_to_fib_num_[n];
         }
 
-        num_to_fib_num[n] = fib(n - 1) + fib(n - 2);
+        num_to_fib_num_[n] = fib(n - 1) + fib(n - 2);
 
-        return num_to_fib_num[n];
+        return num_to_fib_num_[n];
     }
 };
 ```
@@ -229,7 +230,7 @@ public:
 ### Solution 1: Recursion
 ```java
 class Solution {
-    Map<Integer, Integer> numToFibNum = new HashMap<Integer, Integer>();
+    var numToFibNum = new HashMap<Integer, Integer>();
 
     public int fib(int n) {
         if (n <= 1) {
diff --git a/problems/0518-coin-change-ii.md b/problems/0518-coin-change-ii.md
@@ -63,7 +63,7 @@ public class Solution
         var dp = new int[amount + 1];
         dp[0] = 1;
 
-        foreach (var coin in coins)
+        foreach (int coin in coins)
         {
             for (var j = coin; j < dp.Length; j++)
             {
diff --git a/problems/1049-last-stone-weight-ii.md b/problems/1049-last-stone-weight-ii.md
@@ -180,7 +180,7 @@ public class Solution {
         var dp = new bool[sum / 2 + 1];
         dp[0] = true;
 
-        foreach (var stone in stones) {
+        foreach (int stone in stones) {
             for (var j = dp.GetUpperBound(0); j >= stone; j--) {
                 dp[j] = dp[j] || dp[j - stone];
             }

Original file line number	Diff line number	Diff line change
`@@ -63,7 +63,7 @@ public class Solution`
`63`	`63`	`var dp = new int[amount + 1];`
`64`	`64`	`dp[0] = 1;`
`65`	`65`
`66`		`- foreach (var coin in coins)`
	`66`	`+ foreach (int coin in coins)`
`67`	`67`	`{`
`68`	`68`	`for (var j = coin; j < dp.Length; j++)`
`69`	`69`	`{`
Original file line number	Diff line number	Diff line change
`@@ -180,7 +180,7 @@ public class Solution {`
`180`	`180`	`var dp = new bool[sum / 2 + 1];`
`181`	`181`	`dp[0] = true;`
`182`	`182`
`183`		`- foreach (var stone in stones) {`
	`183`	`+ foreach (int stone in stones) {`
`184`	`184`	`for (var j = dp.GetUpperBound(0); j >= stone; j--) {`
`185`	`185`	`dp[j] = dp[j] \|\| dp[j - stone];`
`186`	`186`	`}`