feat: add solutions to lc problem: No.0300

No.0300.Longest Increasing Subsequence

Author: yanglbme

solution/0000-0099/0075.Sort Colors/README.md

@@ -110,7 +110,7 @@ class Solution {
 
     private void swap(int[] nums, int i, int j) {
         int t = nums[i];
-        nums[i]  = nums[j];
+        nums[i] = nums[j];
         nums[j] = t;
     }
 }

solution/0000-0099/0075.Sort Colors/README_EN.md

@@ -78,7 +78,7 @@ class Solution {
 
     private void swap(int[] nums, int i, int j) {
         int t = nums[i];
-        nums[i]  = nums[j];
+        nums[i] = nums[j];
         nums[j] = t;
     }
 }

solution/0000-0099/0075.Sort Colors/Solution.java

@@ -14,7 +14,7 @@ public void sortColors(int[] nums) {
 
     private void swap(int[] nums, int i, int j) {
         int t = nums[i];
-        nums[i]  = nums[j];
+        nums[i] = nums[j];
         nums[j] = t;
     }
 }

solution/0100-0199/0142.Linked List Cycle II/README.md

@@ -162,7 +162,7 @@ public class Solution {
  */
 class Solution {
 public:
-    ListNode *detectCycle(ListNode *head) {
+    ListNode* detectCycle(ListNode* head) {
         ListNode* fast = head;
         ListNode* slow = head;
         while (fast && fast->next) {

solution/0100-0199/0142.Linked List Cycle II/README_EN.md

@@ -142,7 +142,7 @@ public class Solution {
  */
 class Solution {
 public:
-    ListNode *detectCycle(ListNode *head) {
+    ListNode* detectCycle(ListNode* head) {
         ListNode* fast = head;
         ListNode* slow = head;
         while (fast && fast->next) {

solution/0100-0199/0142.Linked List Cycle II/Solution.cpp

@@ -8,7 +8,7 @@
  */
 class Solution {
 public:
-    ListNode *detectCycle(ListNode *head) {
+    ListNode* detectCycle(ListNode* head) {
         ListNode* fast = head;
         ListNode* slow = head;
         while (fast && fast->next) {