Skip to content

Commit c154596

Browse files
pranjal030404idoocs
authored andcommitted
style: format code and docs with prettier
1 parent 1358633 commit c154596

File tree

3 files changed

+3
-3
lines changed

3 files changed

+3
-3
lines changed

solution/0000-0099/0003.Longest Substring Without Repeating Characters/README.md

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

303303
#### C
304304

305-
``` c
305+
```c
306306
int lengthOfLongestSubstring(char *s) {
307307
int freq[256] = {0};
308308
int l = 0, r = 0;

solution/0000-0099/0003.Longest Substring Without Repeating Characters/README_EN.md

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

301301
#### C
302302

303-
```c
303+
```c
304304

305305
int lengthOfLongestSubstring(char *s) {
306306
int freq[256] = {0};

solution/0000-0099/0004.Median of Two Sorted Arrays/README_EN.md

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -348,7 +348,7 @@ proc medianOfTwoSortedArrays(nums1: seq[int], nums2: seq[int]): float =
348348

349349
#### C
350350

351-
``` c
351+
```c
352352
int findKth(int *nums1, int m, int i, int *nums2, int n, int j, int k) {
353353
if (i >= m)
354354
return nums2[j + k - 1];

0 commit comments

Comments
 (0)