Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Sign up
Appearance settings

Commit 1d0c9e9

Browse files
committed
feat: add solutions to lc problem: No.0300
No.0300.Longest Increasing Subsequence
1 parent 373ee31 commit 1d0c9e9

File tree

15 files changed

+629
-727
lines changed

15 files changed

+629
-727
lines changed

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

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -110,7 +110,7 @@ class Solution {
110110

111111
private void swap(int[] nums, int i, int j) {
112112
int t = nums[i];
113-
nums[i] = nums[j];
113+
nums[i] = nums[j];
114114
nums[j] = t;
115115
}
116116
}

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

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -78,7 +78,7 @@ class Solution {
7878

7979
private void swap(int[] nums, int i, int j) {
8080
int t = nums[i];
81-
nums[i] = nums[j];
81+
nums[i] = nums[j];
8282
nums[j] = t;
8383
}
8484
}

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

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -14,7 +14,7 @@ public void sortColors(int[] nums) {
1414

1515
private void swap(int[] nums, int i, int j) {
1616
int t = nums[i];
17-
nums[i] = nums[j];
17+
nums[i] = nums[j];
1818
nums[j] = t;
1919
}
2020
}

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

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -162,7 +162,7 @@ public class Solution {
162162
*/
163163
class Solution {
164164
public:
165-
ListNode*detectCycle(ListNode*head) {
165+
ListNode*detectCycle(ListNode*head) {
166166
ListNode* fast = head;
167167
ListNode* slow = head;
168168
while (fast && fast->next) {

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

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -142,7 +142,7 @@ public class Solution {
142142
*/
143143
class Solution {
144144
public:
145-
ListNode*detectCycle(ListNode*head) {
145+
ListNode*detectCycle(ListNode*head) {
146146
ListNode* fast = head;
147147
ListNode* slow = head;
148148
while (fast && fast->next) {

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

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -8,7 +8,7 @@
88
*/
99
class Solution {
1010
public:
11-
ListNode *detectCycle(ListNode *head) {
11+
ListNode* detectCycle(ListNode* head) {
1212
ListNode* fast = head;
1313
ListNode* slow = head;
1414
while (fast && fast->next) {

0 commit comments

Comments
(0)

AltStyle によって変換されたページ (->オリジナル) /