Merge pull request doocs#4 from doocs/master

merge

Author: kim-up

.github/workflows/sync.yml

@@ -8,10 +8,10 @@ jobs:
   build:
     runs-on: ubuntu-latest
     steps:
-    - name: Sync to Gitee
+    - name: Sync to gitee.com
       uses: wearerequired/git-mirror-action@master
       env:
-          SSH_PRIVATE_KEY: ${{ secrets.GITEE_RSA_PRIVATE_KEY }}
+          SSH_PRIVATE_KEY: ${{ secrets.RSA_PRIVATE_KEY }}
       with:
           source-repo: "[email protected]:doocs/leetcode.git"
           destination-repo: "[email protected]:Doocs/leetcode.git"

basic/sort/QuickSort.java

@@ -0,0 +1,45 @@
+import java.util.Arrays;
+
+public class QuickSort {
+
+    private static void quickSort(int[] nums) {
+        quickSort(nums, 0, nums.length - 1);
+    }
+
+    private static void quickSort(int[] nums, int low, int high) {
+        if (low >= high) {
+            return;
+        }
+        int[] p = partition(nums, low, high);
+        quickSort(nums, low, p[0] - 1);
+        quickSort(nums, p[0] + 1, high);
+    }
+
+    private static int[] partition(int[] nums, int low, int high) {
+        int less = low - 1, more = high;
+
+        while (low < more) {
+            if (nums[low] < nums[high]) {
+                swap(nums, ++less, low++);
+            } else if (nums[low] > nums[high]) {
+                swap(nums, --more, low);
+            } else {
+                ++low;
+            }
+        }
+        swap(nums, more, high);
+        return new int[] {less + 1, more};
+    }
+
+    private static void swap(int[] nums, int i, int j) {
+        int t = nums[i];
+        nums[i] = nums[j];
+        nums[j] = t;
+    }
+
+    public static void main(String[] args) {
+        int[] nums = {1, 2, 7, 4, 5, 3};
+        quickSort(nums);
+        System.out.println(Arrays.toString(nums));
+    }
+}

lcci/01.02.Check Permutation/README.md

@@ -41,7 +41,18 @@ class Solution:
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```java
-
+class Solution {
+    public boolean checkPermutation(String s1, String s2) {
+        if (s1 == null || s2 == null || s1.length() != s2.length()) {
+            return false;
+        }
+        char[] c1 = s1.toCharArray();
+        char[] c2 = s2.toCharArray();
+        Arrays.sort(c1);
+        Arrays.sort(c2);
+        return Arrays.equals(c1, c2);
+    }
+}
 ```
 
 ### ...

lcci/01.02.Check Permutation/README_EN.md

@@ -56,7 +56,18 @@ class Solution:
 ### Java
 
 ```java
-
+class Solution {
+    public boolean CheckPermutation(String s1, String s2) {
+        if (s1 == null || s2 == null || s1.length() != s2.length()) {
+            return false;
+        }
+        char[] c1 = s1.toCharArray();
+        char[] c2 = s2.toCharArray();
+        Arrays.sort(c1);
+        Arrays.sort(c2);
+        return Arrays.equals(c1, c2);
+    }
+}
 ```
 
 ### ...

lcci/01.02.Check Permutation/Solution.java

@@ -0,0 +1,12 @@
+class Solution {
+    public boolean CheckPermutation(String s1, String s2) {
+        if (s1 == null || s2 == null || s1.length() != s2.length()) {
+            return false;
+        }
+        char[] c1 = s1.toCharArray();
+        char[] c2 = s2.toCharArray();
+        Arrays.sort(c1);
+        Arrays.sort(c2);
+        return Arrays.equals(c1, c2);
+    }
+}

lcci/01.03.String to URL/README.md

@@ -41,7 +41,22 @@ class Solution:
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```java
-
+class Solution {
+    public String replaceSpaces(String S, int length) {
+        char[] c = S.toCharArray();
+        int j = c.length;
+        for (int i = length - 1; i >= 0; i--) {
+            if (c[i] == ' ') {
+                c[--j] = '0';
+                c[--j] = '2';
+                c[--j] = '%';
+            } else {
+                c[--j] = c[i];
+            }
+        }
+        return new String(c, j, c.length - j);
+    }
+}
 ```
 
 ### ...

lcci/01.03.String to URL/README_EN.md

@@ -67,7 +67,22 @@ class Solution:
 ### Java
 
 ```java
-
+class Solution {
+    public String replaceSpaces(String S, int length) {
+        char[] c = S.toCharArray();
+        int j = c.length;
+        for (int i = length - 1; i >= 0; i--) {
+            if (c[i] == ' ') {
+                c[--j] = '0';
+                c[--j] = '2';
+                c[--j] = '%';
+            } else {
+                c[--j] = c[i];
+            }
+        }
+        return new String(c, j, c.length - j);
+    }
+}
 ```
 
 ### ...

lcci/01.03.String to URL/Solution.java

@@ -0,0 +1,16 @@
+class Solution {
+    public String replaceSpaces(String S, int length) {
+        char[] c = S.toCharArray();
+        int j = c.length;
+        for (int i = length - 1; i >= 0; i--) {
+            if (c[i] == ' ') {
+                c[--j] = '0';
+                c[--j] = '2';
+                c[--j] = '%';
+            } else {
+                c[--j] = c[i];
+            }
+        }
+        return new String(c, j, c.length - j);
+    }
+}

lcof/面试题29. 顺时针打印矩阵/Solution.cpp

@@ -0,0 +1,35 @@
+class Solution
+{
+public:
+    vector<int> spiralOrder(vector<vector<int>> &matrix)
+    {
+        vector<int> ans;
+        if (matrix.size() == 0)
+            return ans;
+        int left = 0, top = 0, bottom = matrix.size() - 1, right = matrix[0].size() - 1;
+        while (true)
+        {
+            for (int i = left; i <= right; i++)
+                ans.push_back(matrix[top][i]);
+            top++;
+            if (top > bottom)
+                break;
+            for (int i = top; i <= bottom; i++)
+                ans.push_back(matrix[i][right]);
+            right--;
+            if (right < left)
+                break;
+            for (int i = right; i >= left; i--)
+                ans.push_back(matrix[bottom][i]);
+            bottom--;
+            if (bottom < top)
+                break;
+            for (int i = bottom; i >= top; i--)
+                ans.push_back(matrix[i][left]);
+            left++;
+            if (left > right)
+                break;
+        }
+        return ans;
+    }
+};

lcof/面试题29. 顺时针打印矩阵/Solution.rs

@@ -0,0 +1,40 @@
+impl Solution {
+    pub fn spiral_order(matrix: Vec<Vec<i32>>) -> Vec<i32> {
+        let mut ans=Vec::new();
+        if matrix.len()==0{
+            return ans;
+        }
+        let (mut left,mut right,mut top,mut bottom)=(0,matrix[0].len()-1,0,matrix.len()-1);
+        loop{
+            for i in left..right+1{
+                ans.push(matrix[top][i]);
+            }
+            top+=1;
+            if (top as i32)>(bottom as i32){
+                break;
+            }
+            for i in top..bottom+1{
+                ans.push(matrix[i][right]);
+            }
+            right-=1;
+            if (right as i32)<(left as i32){
+                break;
+            }
+            for i in (left..right+1).rev(){
+                ans.push(matrix[bottom][i]);
+            }
+            bottom-=1;
+            if (bottom as i32)<(top as i32){
+                break;
+            }
+            for i in (top..bottom+1).rev(){
+                ans.push(matrix[i][left]);
+            }
+            left+=1;
+            if (left as i32)>(right as i32){
+                break;
+            }
+        }
+        ans
+    }
+  }

lcof/面试题29. 顺时针打印矩阵/Solution.ts

@@ -0,0 +1,23 @@
+var spiralOrder = (matrix: number[][]): number[] => {
+    let ans: number[] = [];
+    if (matrix.length === 0) return ans;
+    let top = 0,
+        left = 0,
+        bottom = matrix.length - 1,
+        right = matrix[0].length - 1;
+    while (true) {
+        for (let i = left; i <= right; i++) ans.push(matrix[top][i]);
+        top++;
+        if (top > bottom) break;
+        for (let i = top; i <= bottom; i++) ans.push(matrix[i][right]);
+        right--;
+        if (right < left) break;
+        for (let i = right; i >= left; i--) ans.push(matrix[bottom][i]);
+        bottom--;
+        if (bottom < top) break;
+        for (let i = bottom; i >= top; i--) ans.push(matrix[i][left]);
+        left++;
+        if (left > right) break;
+    }
+    return ans;
+}

solution/0200-0299/0238.Product of Array Except Self/Solution.cpp

@@ -0,0 +1,23 @@
+class Solution
+{
+public:
+  vector<int> productExceptSelf(vector<int> &nums)
+  {
+    vector<int> dpLeft(nums.size(), 1);
+    vector<int> dpRight(nums.size(), 1);
+    for (int i = 1; i < nums.size(); i++)
+    {
+      dpLeft[i] = dpLeft[i - 1] * nums[i - 1];
+    }
+    for (int i = nums.size() - 2; i >= 0; i--)
+    {
+      dpRight[i] = dpRight[i + 1] * nums[i + 1];
+    }
+    vector<int> result;
+    for (int i = 0; i < nums.size(); i++)
+    {
+      result.push_back(dpLeft[i] * dpRight[i]);
+    }
+    return result;
+  }
+};

solution/0200-0299/0238.Product of Array Except Self/Solution.rs

@@ -0,0 +1,13 @@
+impl Solution {
+  pub fn product_except_self(nums: Vec<i32>) -> Vec<i32> {
+      let mut dp_left=vec![1_i32;nums.len()];
+      let mut dp_right=vec![1_i32;nums.len()];
+      for i in 1..nums.len(){
+          dp_left[i]=dp_left[i-1]*nums[i-1];
+      }
+      for i in (0..(nums.len()-1)).rev(){
+          dp_right[i]=dp_right[i+1]*nums[i+1];
+      }
+      dp_left.into_iter().enumerate().map(|(i,x)| x*dp_right[i]).collect()
+  }
+}

solution/0200-0299/0238.Product of Array Except Self/Solution.ts

@@ -0,0 +1,11 @@
+function productExceptSelf(nums: number[]): number[] {
+  let dpLeft = Array(nums.length).fill(1);
+  let dpRight = Array(nums.length).fill(1);
+  for (let i = 1; i < nums.length; i++) {
+    dpLeft[i] = dpLeft[i - 1] * nums[i - 1];
+  }
+  for (let i = nums.length - 2; i >= 0; i--) {
+    dpRight[i] = dpRight[i + 1] * nums[i + 1];
+  }
+  return dpLeft.map((x, i) => x * dpRight[i]);
+}