Merge branch 'main' of https://github.com/pranjal030404/leetcode.doocs

Author: pranjal030404

images/starcharts.svg

@@ -147,9 +147,9 @@ class Solution {
 class Solution {
 public:
     ListNode* addTwoNumbers(ListNode* l1, ListNode* l2) {
-        ListNode* dummy = new ListNode();
+        ListNode dummy;
         int carry = 0;
-        ListNode* cur = dummy;
+        ListNode* cur = &dummy;
         while (l1 || l2 || carry) {
             int s = (l1 ? l1->val : 0) + (l2 ? l2->val : 0) + carry;
             carry = s / 10;
@@ -158,7 +158,7 @@ public:
             l1 = l1 ? l1->next : nullptr;
             l2 = l2 ? l2->next : nullptr;
         }
-        return dummy->next;
+        return dummy.next;
     }
 };
 ```

solution/0000-0099/0002.Add Two Numbers/README.md

@@ -143,9 +143,9 @@ class Solution {
 class Solution {
 public:
     ListNode* addTwoNumbers(ListNode* l1, ListNode* l2) {
-        ListNode* dummy = new ListNode();
+        ListNode dummy;
         int carry = 0;
-        ListNode* cur = dummy;
+        ListNode* cur = &dummy;
         while (l1 || l2 || carry) {
             int s = (l1 ? l1->val : 0) + (l2 ? l2->val : 0) + carry;
             carry = s / 10;
@@ -154,7 +154,7 @@ public:
             l1 = l1 ? l1->next : nullptr;
             l2 = l2 ? l2->next : nullptr;
         }
-        return dummy->next;
+        return dummy.next;
     }
 };
 ```

solution/0000-0099/0002.Add Two Numbers/README_EN.md

@@ -11,9 +11,9 @@
 class Solution {
 public:
     ListNode* addTwoNumbers(ListNode* l1, ListNode* l2) {
-        ListNode* dummy = new ListNode();
+        ListNode dummy;
         int carry = 0;
-        ListNode* cur = dummy;
+        ListNode* cur = &dummy;
         while (l1 || l2 || carry) {
             int s = (l1 ? l1->val : 0) + (l2 ? l2->val : 0) + carry;
             carry = s / 10;
@@ -22,6 +22,6 @@ class Solution {
             l1 = l1 ? l1->next : nullptr;
             l2 = l2 ? l2->next : nullptr;
         }
-        return dummy->next;
+        return dummy.next;
     }
 };

solution/0000-0099/0002.Add Two Numbers/Solution.cpp

@@ -576,7 +576,6 @@ char *longestPalindrome(char *s) {
 
 ```
 
-
 <!-- tabs:end -->
 
 <!-- solution:end -->

solution/0000-0099/0005.Longest Palindromic Substring/README.md

@@ -527,7 +527,7 @@ class Solution {
 
 #### C
 
-``` c 
+```c
 char *longestPalindrome(char *s) {
   int n = strlen(s);
   if (n == 0) {

solution/0000-0099/0005.Longest Palindromic Substring/README_EN.md

@@ -495,7 +495,7 @@ class Solution {
 
 #### C
 
-``` C 
+```C
 char *convert(char *s, int numRows) {
   if (numRows == 1 || numRows >= strlen(s)) {
     char *result = malloc(strlen(s) + 1);

solution/0000-0099/0006.Zigzag Conversion/README.md

@@ -491,7 +491,7 @@ class Solution {
 }
 ```
 
-#### c
+#### 
 
 ```c
 char *convert(char *s, int numRows) {

solution/0000-0099/0006.Zigzag Conversion/README_EN.md

@@ -214,6 +214,36 @@ class Solution {
 }
 ```
 
+#### C++
+
+```cpp
+class Solution {
+public:
+    int myAtoi(string s) {
+        int i = 0, n = s.size();
+        while (i < n && s[i] == ' ')
+            ++i;
+
+        int sign = 1;
+        if (i < n && (s[i] == '-' || s[i] == '+')) {
+            sign = s[i] == '-' ? -1 : 1;
+            ++i;
+        }
+
+        int res = 0;
+        while (i < n && isdigit(s[i])) {
+            int digit = s[i] - '0';
+            if (res > INT_MAX / 10 || (res == INT_MAX / 10 && digit > INT_MAX % 10)) {
+                return sign == 1 ? INT_MAX : INT_MIN;
+            }
+            res = res * 10 + digit;
+            ++i;
+        }
+        return res * sign;
+    }
+};
+```
+
 #### Go
 
 ```go

solution/0000-0099/0008.String to Integer (atoi)/README.md

@@ -160,19 +160,16 @@ class Solution:
         i = 0
         while s[i] == ' ':
             i += 1
-            # 仅包含空格
             if i == n:
                 return 0
         sign = -1 if s[i] == '-' else 1
         if s[i] in ['-', '+']:
             i += 1
         res, flag = 0, (2**31 - 1) // 10
         while i < n:
-            # 非数字，跳出循环体
             if not s[i].isdigit():
                 break
             c = int(s[i])
-            # 溢出判断
             if res > flag or (res == flag and c > 7):
                 return 2**31 - 1 if sign > 0 else -(2**31)
             res = res * 10 + c
@@ -190,17 +187,14 @@ class Solution {
         if (n == 0) return 0;
         int i = 0;
         while (s.charAt(i) == ' ') {
-            // 仅包含空格
             if (++i == n) return 0;
         }
         int sign = 1;
         if (s.charAt(i) == '-') sign = -1;
         if (s.charAt(i) == '-' || s.charAt(i) == '+') ++i;
         int res = 0, flag = Integer.MAX_VALUE / 10;
         for (; i < n; ++i) {
-            // 非数字，跳出循环体
             if (s.charAt(i) < '0' || s.charAt(i) > '9') break;
-            // 溢出判断
             if (res > flag || (res == flag && s.charAt(i) > '7'))
                 return sign > 0 ? Integer.MAX_VALUE : Integer.MIN_VALUE;
             res = res * 10 + (s.charAt(i) - '0');
@@ -210,6 +204,36 @@ class Solution {
 }
 ```
 
+#### C++
+
+```cpp
+class Solution {
+public:
+    int myAtoi(string s) {
+        int i = 0, n = s.size();
+        while (i < n && s[i] == ' ')
+            ++i;
+
+        int sign = 1;
+        if (i < n && (s[i] == '-' || s[i] == '+')) {
+            sign = s[i] == '-' ? -1 : 1;
+            ++i;
+        }
+
+        int res = 0;
+        while (i < n && isdigit(s[i])) {
+            int digit = s[i] - '0';
+            if (res > INT_MAX / 10 || (res == INT_MAX / 10 && digit > INT_MAX % 10)) {
+                return sign == 1 ? INT_MAX : INT_MIN;
+            }
+            res = res * 10 + digit;
+            ++i;
+        }
+        return res * sign;
+    }
+};
+```
+
 #### Go
 
 ```go
@@ -282,8 +306,6 @@ const myAtoi = function (str) {
 #### C#
 
 ```cs
-// https://leetcode.com/problems/string-to-integer-atoi/
-
 public partial class Solution
 {
     public int MyAtoi(string str)

solution/0000-0099/0008.String to Integer (atoi)/README_EN.md

@@ -0,0 +1,25 @@
+class Solution {
+public:
+    int myAtoi(string s) {
+        int i = 0, n = s.size();
+        while (i < n && s[i] == ' ')
+            ++i;
+
+        int sign = 1;
+        if (i < n && (s[i] == '-' || s[i] == '+')) {
+            sign = s[i] == '-' ? -1 : 1;
+            ++i;
+        }
+
+        int res = 0;
+        while (i < n && isdigit(s[i])) {
+            int digit = s[i] - '0';
+            if (res > INT_MAX / 10 || (res == INT_MAX / 10 && digit > INT_MAX % 10)) {
+                return sign == 1 ? INT_MAX : INT_MIN;
+            }
+            res = res * 10 + digit;
+            ++i;
+        }
+        return res * sign;
+    }
+};

solution/0000-0099/0008.String to Integer (atoi)/Solution.cpp

@@ -57,10 +57,10 @@ tags:
 <p><strong>提示:</strong></p>
 
 <ul>
-	<li><code>gas.length == n</code></li>
-	<li><code>cost.length == n</code></li>
+	<li><code>n == gas.length == cost.length</code></li>
 	<li><code>1 &lt;= n &lt;= 10<sup>5</sup></code></li>
 	<li><code>0 &lt;= gas[i], cost[i] &lt;= 10<sup>4</sup></code></li>
+	<li>输入保证答案唯一。</li>
 </ul>
 
 <!-- description:end -->

solution/0100-0199/0134.Gas Station/README.md

@@ -60,6 +60,7 @@ Therefore, you can't travel around the circuit once no matter where you star
 	<li><code>n == gas.length == cost.length</code></li>
 	<li><code>1 &lt;= n &lt;= 10<sup>5</sup></code></li>
 	<li><code>0 &lt;= gas[i], cost[i] &lt;= 10<sup>4</sup></code></li>
+	<li>The input is generated such that the answer is unique.</li>
 </ul>
 
 <!-- description:end -->

solution/0100-0199/0134.Gas Station/README_EN.md

@@ -203,6 +203,35 @@ function candy(ratings: number[]): number {
 }
 ```
 
+#### Rust
+
+```rust
+impl Solution {
+    pub fn candy(ratings: Vec<i32>) -> i32 {
+        let n = ratings.len();
+        let mut left = vec![1; n];
+        let mut right = vec![1; n];
+
+        for i in 1..n {
+            if ratings[i] > ratings[i - 1] {
+                left[i] = left[i - 1] + 1;
+            }
+        }
+
+        for i in (0..n - 1).rev() {
+            if ratings[i] > ratings[i + 1] {
+                right[i] = right[i + 1] + 1;
+            }
+        }
+
+        ratings.iter()
+            .enumerate()
+            .map(|(i, _)| left[i].max(right[i]) as i32)
+            .sum()
+    }
+}
+```
+
 #### C#
 
 ```cs
@@ -236,46 +265,4 @@ public class Solution {
 
 <!-- solution:end -->
 
-<!-- solution:start -->
-
-### 方法二
-
-<!-- tabs:start -->
-
-#### Java
-
-```java
-class Solution {
-    public int candy(int[] ratings) {
-        int n = ratings.length;
-        int up = 0;
-        int down = 0;
-        int peak = 0;
-        int candies = 1;
-        for (int i = 1; i < n; i++) {
-            if (ratings[i - 1] < ratings[i]) {
-                up++;
-                peak = up + 1;
-                down = 0;
-                candies += peak;
-            } else if (ratings[i] == ratings[i - 1]) {
-                peak = 0;
-                up = 0;
-                down = 0;
-                candies++;
-            } else {
-                down++;
-                up = 0;
-                candies += down + (peak > down ? 0 : 1);
-            }
-        }
-        return candies;
-    }
-}
-```
-
-<!-- tabs:end -->
-
-<!-- solution:end -->
-
 <!-- problem:end -->