Improved tasks 30, 50, 54, 57, 58

javadev · web-flow · commit 7f8f9d4d9d8f · 2025-07-02T07:31:37.000+03:00
diff --git a/LeetCodeNet/G0001_0100/S0030_substring_with_concatenation_of_all_words/Solution.cs b/LeetCodeNet/G0001_0100/S0030_substring_with_concatenation_of_all_words/Solution.cs
@@ -1,10 +1,10 @@
-using System.Collections.Generic;
-
 namespace LeetCodeNet.G0001_0100.S0030_substring_with_concatenation_of_all_words {
 
 // #Hard #String #Hash_Table #Sliding_Window #Top_Interview_150_Sliding_Window
 // #2025_06_30_Time_15_ms_(94.14%)_Space_57.94_MB_(46.58%)
 
+using System.Collections.Generic;
+
 public class Solution {
     public IList<int> FindSubstring(string s, string[] words) {
         var res = new List<int>();
diff --git a/LeetCodeNet/G0001_0100/S0050_powx_n/Solution.cs b/LeetCodeNet/G0001_0100/S0050_powx_n/Solution.cs
@@ -1,23 +1,28 @@
 namespace LeetCodeNet.G0001_0100.S0050_powx_n {
 
 // #Medium #Top_Interview_Questions #Math #Recursion #Udemy_Integers #Top_Interview_150_Math
-// #2025_07_01_Time_0_ms_(100.00%)_Space_29.14_MB_(83.57%)
+// #2025_07_02_Time_0_ms_(100.00%)_Space_29.32_MB_(55.95%)
 
 public class Solution {
     public double MyPow(double x, int n) {
-        if (n == 0) return 1.0;
-        long N = n;
-        if (N < 0) {
-            x = 1 / x;
-            N = -N;
+        long nn = n;
+        double res = 1;
+        if (n < 0) {
+            nn *= -1;
         }
-        double result = 1.0;
-        while (N > 0) {
-            if ((N & 1) == 1) result *= x;
-            x *= x;
-            N >>= 1;
+        while (nn > 0) {
+            if ((nn % 2) == 1) {
+                nn--;
+                res *= x;
+            } else {
+                x *= x;
+                nn /= 2;
+            }
         }
-        return result;
+        if (n < 0) {
+            return 1.0 / res;
+        }
+        return res;
     }
 }
 }
diff --git a/LeetCodeNet/G0001_0100/S0054_spiral_matrix/Solution.cs b/LeetCodeNet/G0001_0100/S0054_spiral_matrix/Solution.cs
@@ -1,28 +1,42 @@
-using System.Collections.Generic;
-
 namespace LeetCodeNet.G0001_0100.S0054_spiral_matrix {
 
 // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Matrix #Simulation
 // #Programming_Skills_II_Day_8 #Level_2_Day_1_Implementation/Simulation #Udemy_2D_Arrays/Matrix
 // #Top_Interview_150_Matrix #2025_07_01_Time_0_ms_(100.00%)_Space_46.80_MB_(7.91%)
 
+using System.Collections.Generic;
+
 public class Solution {
     public IList<int> SpiralOrder(int[][] matrix) {
         var res = new List<int>();
-        if (matrix == null || matrix.Length == 0) return res;
-        int m = matrix.Length, n = matrix[0].Length;
-        int top = 0, bottom = m - 1, left = 0, right = n - 1;
+        if (matrix == null || matrix.Length == 0) {
+            return res;
+        }
+        int m = matrix.Length;
+        int n = matrix[0].Length;
+        int top = 0;
+        int bottom = m - 1;
+        int left = 0;
+        int right = n - 1;
         while (top <= bottom && left <= right) {
-            for (int j = left; j <= right; j++) res.Add(matrix[top][j]);
+            for (int j = left; j <= right; j++) {
+                res.Add(matrix[top][j]);
+            }
             top++;
-            for (int i = top; i <= bottom; i++) res.Add(matrix[i][right]);
+            for (int i = top; i <= bottom; i++) {
+                res.Add(matrix[i][right]);
+            }
             right--;
             if (top <= bottom) {
-                for (int j = right; j >= left; j--) res.Add(matrix[bottom][j]);
+                for (int j = right; j >= left; j--) {
+                    res.Add(matrix[bottom][j]);
+                }
                 bottom--;
             }
             if (left <= right) {
-                for (int i = bottom; i >= top; i--) res.Add(matrix[i][left]);
+                for (int i = bottom; i >= top; i--) {
+                    res.Add(matrix[i][left]);
+                }
                 left++;
             }
         }
diff --git a/LeetCodeNet/G0001_0100/S0057_insert_interval/Solution.cs b/LeetCodeNet/G0001_0100/S0057_insert_interval/Solution.cs
@@ -1,10 +1,10 @@
-using System.Collections.Generic;
-
 namespace LeetCodeNet.G0001_0100.S0057_insert_interval {
 
 // #Medium #Array #Level_2_Day_17_Interval #Top_Interview_150_Intervals
 // #2025_07_01_Time_1_ms_(99.33%)_Space_51.29_MB_(48.12%)
 
+using System.Collections.Generic;
+
 public class Solution {
     public int[][] Insert(int[][] intervals, int[] newInterval) {
         var result = new List<int[]>();
diff --git a/LeetCodeNet/G0001_0100/S0058_length_of_last_word/Solution.cs b/LeetCodeNet/G0001_0100/S0058_length_of_last_word/Solution.cs
@@ -1,17 +1,20 @@
 namespace LeetCodeNet.G0001_0100.S0058_length_of_last_word {
 
 // #Easy #String #Programming_Skills_II_Day_6 #Udemy_Arrays #Top_Interview_150_Array/String
-// #2025_07_01_Time_0_ms_(100.00%)_Space_40.26_MB_(15.20%)
+// #2025_07_02_Time_0_ms_(100.00%)_Space_40.17_MB_(24.14%)
 
 public class Solution {
     public int LengthOfLastWord(string s) {
-        int length = 0, i = s.Length - 1;
-        while (i >= 0 && s[i] == ' ') i--;
-        while (i >= 0 && s[i] != ' ') {
-            length++;
-            i--;
+        int len = 0;
+        for (int i = s.Length - 1; i >= 0; i--) {
+            char ch = s[i];
+            if (ch == ' ' && len > 0) {
+                break;
+            } else if (ch != ' ') {
+                len++;
+            }
         }
-        return length;
+        return len;
     }
 }
 }
