Skip to content

Commit 9324b58

Browse files
yanglbmeyanglbme
authored
style: format inline code block (doocs#1038)
1 parent cf29a78 commit 9324b58

File tree

1,359 files changed

+4118
-4886
lines changed

Some content is hidden

Large Commits have some content hidden by default. Use the searchbox below for content that may be hidden.

1,359 files changed

+4118
-4886
lines changed

‎basic/searching/BinarySearch/README.md

+2-1
Original file line numberDiff line numberDiff line change
@@ -7,7 +7,8 @@
77
### 模板 1
88

99
```java
10-
boolean check(int x) {}
10+
boolean check(int x) {
11+
}
1112

1213
int search(int left, int right) {
1314
while (left < right) {

‎basic/searching/BinarySearch/README_EN.md

+2-1
Original file line numberDiff line numberDiff line change
@@ -5,7 +5,8 @@
55
### Template 1
66

77
```java
8-
boolean check(int x) {}
8+
boolean check(int x) {
9+
}
910

1011
int search(int left, int right) {
1112
while (left < right) {

‎basic/sorting/BubbleSort/BubbleSort.go

+1-1
Original file line numberDiff line numberDiff line change
@@ -19,4 +19,4 @@ func main() {
1919
nums := []int{1, 2, 7, 9, 5, 8}
2020
bubbleSort(nums)
2121
fmt.Println(nums)
22-
}
22+
}

‎basic/sorting/CountingSort/CountingSort.go

+2-2
Original file line numberDiff line numberDiff line change
@@ -1,4 +1,4 @@
1-
package CountingSort
1+
package main
22

33
func CountingSort(nums []int, min, max int) {
44
n := len(nums)
@@ -23,4 +23,4 @@ func CountingSort(nums []int, min, max int) {
2323
for i, v := range r {
2424
nums[i] = v
2525
}
26-
}
26+
}

‎basic/sorting/CountingSort/CountingSort.java

+19-17
Original file line numberDiff line numberDiff line change
@@ -1,19 +1,21 @@
1-
public static void sort(int[] nums, int min, int max) {
2-
int n = nums.length;
3-
int k = max - min + 1;
4-
int[] c = new int[k];
5-
for (int v : nums) {
6-
c[v - min]++;
1+
public class CountingSort {
2+
public static void sort(int[] nums, int min, int max) {
3+
int n = nums.length;
4+
int k = max - min + 1;
5+
int[] c = new int[k];
6+
for (int v : nums) {
7+
c[v - min]++;
8+
}
9+
for (int i = 1; i < k; i++) {
10+
c[i] += c[i - 1];
11+
}
12+
int[] r = new int[n];
13+
for (int i = n - 1; i >= 0; i--) {
14+
int v = nums[i];
15+
int a = c[v];
16+
r[a - 1] = v + min;
17+
c[v]--;
18+
}
19+
System.arraycopy(r, 0, nums, 0, n);
720
}
8-
for (int i = 1; i < k; i++) {
9-
c[i] += c[i - 1];
10-
}
11-
int[] r = new int[n];
12-
for (int i = n - 1; i >= 0; i--) {
13-
int v = nums[i];
14-
int a = c[v];
15-
r[a - 1] = v + min;
16-
c[v]--;
17-
}
18-
System.arraycopy(r, 0, nums, 0, n);
1921
}

‎basic/sorting/CountingSort/README.md

+19-15
Original file line numberDiff line numberDiff line change
@@ -17,22 +17,26 @@
1717
### **Java**
1818

1919
```java
20-
public static void sort(int[] nums, int min, int max) {
21-
int[] c = new int[max - min + 1];
22-
for (int v : nums) {
23-
c[v - min]++;
20+
public class CountingSort {
21+
public static void sort(int[] nums, int min, int max) {
22+
int n = nums.length;
23+
int k = max - min + 1;
24+
int[] c = new int[k];
25+
for (int v : nums) {
26+
c[v - min]++;
27+
}
28+
for (int i = 1; i < k; i++) {
29+
c[i] += c[i - 1];
30+
}
31+
int[] r = new int[n];
32+
for (int i = n - 1; i >= 0; i--) {
33+
int v = nums[i];
34+
int a = c[v];
35+
r[a - 1] = v + min;
36+
c[v]--;
37+
}
38+
System.arraycopy(r, 0, nums, 0, n);
2439
}
25-
for (int i = 1; i < c.length; i++) {
26-
c[i] += c[i - 1];
27-
}
28-
int[] r = new int[nums.length];
29-
for (int i = nums.length - 1; i >= 0; i--) {
30-
int v = nums[i];
31-
int a = c[v];
32-
r[a - 1] = v + min;
33-
c[v]--;
34-
}
35-
System.arraycopy(r, 0, nums, 0, r.length);
3640
}
3741
```
3842

‎basic/sorting/HeapSort/Main.go

+1-1
Original file line numberDiff line numberDiff line change
@@ -48,4 +48,4 @@ func main() {
4848
size--
4949
down(1)
5050
}
51-
}
51+
}

‎basic/sorting/InsertionSort/InsertionSort.go

+1-1
Original file line numberDiff line numberDiff line change
@@ -16,4 +16,4 @@ func main() {
1616
nums := []int{1, 2, 7, 9, 5, 8}
1717
insertionSort(nums)
1818
fmt.Println(nums)
19-
}
19+
}

‎basic/sorting/QuickSort/Main.go

+1-1
Original file line numberDiff line numberDiff line change
@@ -42,4 +42,4 @@ func main() {
4242
for _, v := range nums {
4343
fmt.Printf("%d ", v)
4444
}
45-
}
45+
}

‎basic/sorting/QuickSort/README.md

+4-2
Original file line numberDiff line numberDiff line change
@@ -12,8 +12,10 @@ void quickSort(int[] nums, int left, int right) {
1212
int i = left - 1, j = right + 1;
1313
int x = nums[left];
1414
while (i < j) {
15-
while (nums[++i] < x);
16-
while (nums[--j] > x);
15+
while (nums[++i] < x)
16+
;
17+
while (nums[--j] > x)
18+
;
1719
if (i < j) {
1820
int t = nums[i];
1921
nums[i] = nums[j];

‎basic/sorting/SelectionSort/SelectionSort.go

+1-1
Original file line numberDiff line numberDiff line change
@@ -18,4 +18,4 @@ func main() {
1818
nums := []int{1, 2, 7, 9, 5, 8}
1919
selectionSort(nums)
2020
fmt.Println(nums)
21-
}
21+
}

‎basic/sorting/ShellSort/ShellSort.go

+1-1
Original file line numberDiff line numberDiff line change
@@ -19,4 +19,4 @@ func main() {
1919
nums := []int{1, 2, 7, 9, 5, 8}
2020
shellSort(nums)
2121
fmt.Println(nums)
22-
}
22+
}

‎lcci/01.02.Check Permutation/README.md

+3-2
Original file line numberDiff line numberDiff line change
@@ -112,8 +112,9 @@ public:
112112
bool CheckPermutation(string s1, string s2) {
113113
if (s1.size() != s2.size()) return false;
114114
int cnt[26] = {0};
115-
for (char & c : s1) ++cnt[c - 'a'];
116-
for (char & c : s2) if (--cnt[c - 'a'] < 0) return false;
115+
for (char& c : s1) ++cnt[c - 'a'];
116+
for (char& c : s2)
117+
if (--cnt[c - 'a'] < 0) return false;
117118
return true;
118119
}
119120
};

‎lcci/01.02.Check Permutation/README_EN.md

+3-2
Original file line numberDiff line numberDiff line change
@@ -92,8 +92,9 @@ public:
9292
bool CheckPermutation(string s1, string s2) {
9393
if (s1.size() != s2.size()) return false;
9494
int cnt[26] = {0};
95-
for (char & c : s1) ++cnt[c - 'a'];
96-
for (char & c : s2) if (--cnt[c - 'a'] < 0) return false;
95+
for (char& c : s1) ++cnt[c - 'a'];
96+
for (char& c : s2)
97+
if (--cnt[c - 'a'] < 0) return false;
9798
return true;
9899
}
99100
};

‎lcci/01.04.Palindrome Permutation/README.md

+1-1
Original file line numberDiff line numberDiff line change
@@ -63,7 +63,7 @@ class Solution:
6363
```java
6464
class Solution {
6565
public boolean canPermutePalindrome(String s) {
66-
Map<Character, Integer> cnt = new HashMap<>();
66+
Map<Character, Integer> cnt = new HashMap<>();
6767
for (int i = 0; i < s.length(); ++i) {
6868
cnt.merge(s.charAt(i), 1, Integer::sum);
6969
}

‎lcci/01.04.Palindrome Permutation/README_EN.md

+1-1
Original file line numberDiff line numberDiff line change
@@ -48,7 +48,7 @@ class Solution:
4848
```java
4949
class Solution {
5050
public boolean canPermutePalindrome(String s) {
51-
Map<Character, Integer> cnt = new HashMap<>();
51+
Map<Character, Integer> cnt = new HashMap<>();
5252
for (int i = 0; i < s.length(); ++i) {
5353
cnt.merge(s.charAt(i), 1, Integer::sum);
5454
}

‎lcci/01.08.Zero Matrix/README.md

+4-4
Original file line numberDiff line numberDiff line change
@@ -400,11 +400,11 @@ var setZeroes = function (matrix) {
400400
### **C**
401401

402402
```c
403-
void setZeroes(int **matrix, int matrixSize, int *matrixColSize) {
403+
void setZeroes(int** matrix, int matrixSize, int* matrixColSize) {
404404
int m = matrixSize;
405405
int n = matrixColSize[0];
406-
int *rows = (int *) malloc(sizeof(int) * m);
407-
int *cols = (int *) malloc(sizeof(int) * n);
406+
int* rows = (int*) malloc(sizeof(int) * m);
407+
int* cols = (int*) malloc(sizeof(int) * n);
408408
memset(rows, 0, sizeof(int) * m);
409409
memset(cols, 0, sizeof(int) * n);
410410
for (int i = 0; i < m; i++) {
@@ -428,7 +428,7 @@ void setZeroes(int **matrix, int matrixSize, int *matrixColSize) {
428428
```
429429
430430
```c
431-
void setZeroes(int **matrix, int matrixSize, int *matrixColSize) {
431+
void setZeroes(int** matrix, int matrixSize, int* matrixColSize) {
432432
int m = matrixSize;
433433
int n = matrixColSize[0];
434434
int l0 = 0;

‎lcci/01.08.Zero Matrix/README_EN.md

+4-4
Original file line numberDiff line numberDiff line change
@@ -405,11 +405,11 @@ var setZeroes = function (matrix) {
405405
### **C**
406406

407407
```c
408-
void setZeroes(int **matrix, int matrixSize, int *matrixColSize) {
408+
void setZeroes(int** matrix, int matrixSize, int* matrixColSize) {
409409
int m = matrixSize;
410410
int n = matrixColSize[0];
411-
int *rows = (int *) malloc(sizeof(int) * m);
412-
int *cols = (int *) malloc(sizeof(int) * n);
411+
int* rows = (int*) malloc(sizeof(int) * m);
412+
int* cols = (int*) malloc(sizeof(int) * n);
413413
memset(rows, 0, sizeof(int) * m);
414414
memset(cols, 0, sizeof(int) * n);
415415
for (int i = 0; i < m; i++) {
@@ -433,7 +433,7 @@ void setZeroes(int **matrix, int matrixSize, int *matrixColSize) {
433433
```
434434
435435
```c
436-
void setZeroes(int **matrix, int matrixSize, int *matrixColSize) {
436+
void setZeroes(int** matrix, int matrixSize, int* matrixColSize) {
437437
int m = matrixSize;
438438
int n = matrixColSize[0];
439439
int l0 = 0;

‎lcci/04.01.Route Between Nodes/README.md

+3-3
Original file line numberDiff line numberDiff line change
@@ -153,7 +153,7 @@ public:
153153
bool findWhetherExistsPath(int n, vector<vector<int>>& graph, int start, int target) {
154154
unordered_map<int, vector<int>> g;
155155
for (auto& e : graph) g[e[0]].push_back(e[1]);
156-
unordered_set<int> vis {{start}};
156+
unordered_set<int> vis{{start}};
157157
return dfs(start, target, g, vis);
158158
}
159159

@@ -176,8 +176,8 @@ public:
176176
bool findWhetherExistsPath(int n, vector<vector<int>>& graph, int start, int target) {
177177
unordered_map<int, vector<int>> g;
178178
for (auto& e : graph) g[e[0]].push_back(e[1]);
179-
queue<int> q {{start}};
180-
unordered_set<int> vis {{start}};
179+
queue<int> q{{start}};
180+
unordered_set<int> vis{{start}};
181181
while (!q.empty()) {
182182
int u = q.front();
183183
if (u == target) return true;

‎lcci/04.01.Route Between Nodes/README_EN.md

+3-3
Original file line numberDiff line numberDiff line change
@@ -152,7 +152,7 @@ public:
152152
bool findWhetherExistsPath(int n, vector<vector<int>>& graph, int start, int target) {
153153
unordered_map<int, vector<int>> g;
154154
for (auto& e : graph) g[e[0]].push_back(e[1]);
155-
unordered_set<int> vis {{start}};
155+
unordered_set<int> vis{{start}};
156156
return dfs(start, target, g, vis);
157157
}
158158

@@ -175,8 +175,8 @@ public:
175175
bool findWhetherExistsPath(int n, vector<vector<int>>& graph, int start, int target) {
176176
unordered_map<int, vector<int>> g;
177177
for (auto& e : graph) g[e[0]].push_back(e[1]);
178-
queue<int> q {{start}};
179-
unordered_set<int> vis {{start}};
178+
queue<int> q{{start}};
179+
unordered_set<int> vis{{start}};
180180
while (!q.empty()) {
181181
int u = q.front();
182182
if (u == target) return true;

‎lcci/04.06.Successor/README.md

+3-3
Original file line numberDiff line numberDiff line change
@@ -156,9 +156,9 @@ public:
156156
*/
157157
class Solution {
158158
public:
159-
TreeNode *inorderSuccessor(TreeNode *root, TreeNode *p) {
160-
stack<TreeNode *> stk;
161-
TreeNode *cur = root;
159+
TreeNode* inorderSuccessor(TreeNode* root, TreeNode* p) {
160+
stack<TreeNode*> stk;
161+
TreeNode* cur = root;
162162
while (cur != nullptr || !stk.empty()) {
163163
if (cur == nullptr) {
164164
cur = stk.top();

‎lcci/04.06.Successor/README_EN.md

+3-3
Original file line numberDiff line numberDiff line change
@@ -169,9 +169,9 @@ public:
169169
*/
170170
class Solution {
171171
public:
172-
TreeNode *inorderSuccessor(TreeNode *root, TreeNode *p) {
173-
stack<TreeNode *> stk;
174-
TreeNode *cur = root;
172+
TreeNode* inorderSuccessor(TreeNode* root, TreeNode* p) {
173+
stack<TreeNode*> stk;
174+
TreeNode* cur = root;
175175
while (cur != nullptr || !stk.empty()) {
176176
if (cur == nullptr) {
177177
cur = stk.top();

‎lcci/08.04.Power Set/README.md

+3-6
Original file line numberDiff line numberDiff line change
@@ -160,13 +160,10 @@ public:
160160
vector<vector<int>> ans;
161161
vector<int> t;
162162
int n = nums.size();
163-
for (int mask = 0; mask < 1 << n; ++mask)
164-
{
163+
for (int mask = 0; mask < 1 << n; ++mask) {
165164
t.clear();
166-
for (int i = 0; i < n; ++i)
167-
{
168-
if ((mask >> i) & 1)
169-
{
165+
for (int i = 0; i < n; ++i) {
166+
if ((mask >> i) & 1) {
170167
t.push_back(nums[i]);
171168
}
172169
}

‎lcci/08.04.Power Set/README_EN.md

+3-6
Original file line numberDiff line numberDiff line change
@@ -153,13 +153,10 @@ public:
153153
vector<vector<int>> ans;
154154
vector<int> t;
155155
int n = nums.size();
156-
for (int mask = 0; mask < 1 << n; ++mask)
157-
{
156+
for (int mask = 0; mask < 1 << n; ++mask) {
158157
t.clear();
159-
for (int i = 0; i < n; ++i)
160-
{
161-
if ((mask >> i) & 1)
162-
{
158+
for (int i = 0; i < n; ++i) {
159+
if ((mask >> i) & 1) {
163160
t.push_back(nums[i]);
164161
}
165162
}

‎lcci/08.10.Color Fill/README.md

+2-1
Original file line numberDiff line numberDiff line change
@@ -112,7 +112,8 @@ class Solution {
112112
}
113113

114114
private void dfs(int i, int j) {
115-
if (i < 0 || i >= image.length || j < 0 || j >= image[0].length || image[i][j] != oc || image[i][j] == nc) {
115+
if (i < 0 || i >= image.length || j < 0 || j >= image[0].length || image[i][j] != oc
116+
|| image[i][j] == nc) {
116117
return;
117118
}
118119
image[i][j] = nc;

‎lcci/08.10.Color Fill/README_EN.md

+2-1
Original file line numberDiff line numberDiff line change
@@ -109,7 +109,8 @@ class Solution {
109109
}
110110

111111
private void dfs(int i, int j) {
112-
if (i < 0 || i >= image.length || j < 0 || j >= image[0].length || image[i][j] != oc || image[i][j] == nc) {
112+
if (i < 0 || i >= image.length || j < 0 || j >= image[0].length || image[i][j] != oc
113+
|| image[i][j] == nc) {
113114
return;
114115
}
115116
image[i][j] = nc;

‎lcci/10.10.Rank from Stream/README.md

+1-1
Original file line numberDiff line numberDiff line change
@@ -163,7 +163,7 @@ public:
163163

164164
BinaryIndexedTree(int _n)
165165
: n(_n)
166-
, c(_n + 1) { }
166+
, c(_n + 1) {}
167167

168168
void update(int x, int delta) {
169169
while (x <= n) {

‎lcci/10.10.Rank from Stream/README_EN.md

+1-1
Original file line numberDiff line numberDiff line change
@@ -146,7 +146,7 @@ public:
146146

147147
BinaryIndexedTree(int _n)
148148
: n(_n)
149-
, c(_n + 1) { }
149+
, c(_n + 1) {}
150150

151151
void update(int x, int delta) {
152152
while (x <= n) {

0 commit comments

Comments
 (0)