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 1a1f0dc

Browse files
committed
Use more standardized markdown syntax for description.md.
1 parent 2f93a97 commit 1a1f0dc

File tree

3 files changed

+49
-52
lines changed

3 files changed

+49
-52
lines changed

‎data/problems/LongestSubstringWithoutRepeatingCharacters/description.md

Lines changed: 14 additions & 17 deletions
Original file line numberDiff line numberDiff line change
@@ -3,31 +3,28 @@
33
Given a string `s`, find the length of the longest substring that has no repeating characters.
44

55

6-
***Example 1:***
6+
**Example 1:**\
7+
>**Input:** s = "abcabcbb"\
8+
>**Output:** 3\
9+
>**Explanation:** The answer is "abc", with the length of 3.
710
8-
&emsp;&emsp;***Input:*** s = "abcabcbb"<br>
9-
&emsp;&emsp;***Output:*** 3<br>
10-
&emsp;&emsp;***Explanation:*** The answer is "abc", with the length of 3.
1111

1212

13+
**Example 2:**\
14+
>**Input:** s = "bbbbb"\
15+
>**Output:** 1\
16+
>**Explanation:** The answer is "b", with the length of 1.
1317
14-
***Example 2:***
1518

16-
&emsp;&emsp;***Input:*** s = "bbbbb"<br>
17-
&emsp;&emsp;***Output:*** 1<br>
18-
&emsp;&emsp;***Explanation:*** The answer is "b", with the length of 1.<br>
1919

20-
21-
22-
***Example 3:***
23-
24-
&emsp;&emsp;***Input:*** s = "pwwkew"<br>
25-
&emsp;&emsp;***Output:*** 3<br>
26-
&emsp;&emsp;***Explanation:*** The answer is "wke", with the length of 3.<br>
27-
&emsp;&emsp;Notice that the answer must be a substring, "pwke" is a subsequence and not a substring.
20+
**Example 3:**\
21+
>**Input:** s = "pwwkew"\
22+
>**Output:** 3\
23+
>**Explanation:** The answer is "wke", with the length of 3.\
24+
>Notice that the answer must be a substring, "pwke" is a subsequence and not a substring.
2825
2926

30-
***Constraints:***
27+
**Constraints:**
3128

3229
* ``0 <= s.length <= 5 * 104``
3330
* ``s consists of English letters, digits, symbols and spaces.``

‎data/problems/NumberOfIslands/description.md

Lines changed: 20 additions & 20 deletions
Original file line numberDiff line numberDiff line change
@@ -3,31 +3,31 @@
33
Given a binary grid of size ```m x n``` that represents a map, where ```'1'``` signifies land and ```'0'``` signifies water, calculate and return the total number of islands present.
44

55
An island is surrounded by water and is formed by connecting neightbouring lands horizontally or vertically. You may assume all four edges of the grid are all surrounded by water.
6-
<br>
7-
<br>
8-
<br>
9-
***Example 1:***
6+
\
7+
\
8+
\
9+
**Example 1:**
1010

11-
&emsp;&emsp;***Input:*** grid = [<br>
12-
&emsp;&emsp;&emsp;&emsp;["1","1","1","1","0"],<br>
13-
&emsp;&emsp;&emsp;&emsp;["1","1","0","1","0"],<br>
14-
&emsp;&emsp;&emsp;&emsp;["1","1","0","0","0"],<br>
15-
&emsp;&emsp;&emsp;&emsp;["0","0","0","0","0"]<br>
16-
&emsp;&emsp;]<br>
17-
&emsp;&emsp;***Output:*** 1
11+
>**Input:** grid = [\
12+
>&emsp;&emsp;["1","1","1","1","0"],\
13+
>&emsp;&emsp;["1","1","0","1","0"],\
14+
>&emsp;&emsp;["1","1","0","0","0"],\
15+
>&emsp;&emsp;["0","0","0","0","0"]\
16+
>]\
17+
>**Output:** 1
1818
19-
***Example 2:***
19+
**Example 2:**
2020

21-
&emsp;&emsp;***Input:*** grid = [<br>
22-
&emsp;&emsp;&emsp;&emsp;["1","1","0","0","0"],<br>
23-
&emsp;&emsp;&emsp;&emsp;["1","1","0","0","0"],<br>
24-
&emsp;&emsp;&emsp;&emsp;["0","0","1","0","0"],<br>
25-
&emsp;&emsp;&emsp;&emsp;["0","0","0","1","1"]<br>
26-
&emsp;&emsp;]<br>
27-
&emsp;&emsp;***Output:*** 3
21+
>**Input:** grid = [\
22+
>&emsp;&emsp;["1","1","0","0","0"],\
23+
>&emsp;&emsp;["1","1","0","0","0"],\
24+
>&emsp;&emsp;["0","0","1","0","0"],\
25+
>&emsp;&emsp;["0","0","0","1","1"]\
26+
>]\
27+
>**Output:** 3
2828
2929

30-
***Constraints:***
30+
**Constraints:**
3131

3232
* ``m == grid.length``
3333
* ``n == grid[i].length``

‎data/problems/TwoSum/description.md

Lines changed: 15 additions & 15 deletions
Original file line numberDiff line numberDiff line change
@@ -5,32 +5,32 @@ You are given an array of integers ``nums`` and an integer ``target``, return in
55
You may assume that the array has exactly one solution, and you may not use the same interger twice.
66

77
You can return the answer in any order.
8-
<br>
9-
<br>
10-
<br>
11-
***Example 1:***
8+
\
9+
\
10+
\
11+
**Example 1:**
1212

13-
&emsp;&emsp;***Input:*** nums = [3,7,11,25], target = 10<br>
14-
&emsp;&emsp;***Output:*** [0,1]<br>
15-
&emsp;&emsp;***Explanation:*** Because nums[0] + nums[1] == 10, we return [0, 1].
13+
>**Input:** nums = [3,7,11,25], target = 10\
14+
>**Output:** [0,1]\
15+
>**Explanation:** Because nums[0] + nums[1] == 10, we return [0, 1].
1616
1717

18-
***Example 2:***
18+
**Example 2:**
1919

20-
&emsp;&emsp;***Input:*** nums = [1,3,4], target = 7<br>
21-
&emsp;&emsp;***Output:*** [1,2]
20+
>**Input:** nums = [1,3,4], target = 7\
21+
>**Output:** [1,2]
2222
2323

2424

25-
***Example 3:***
25+
**Example 3:**
2626

27-
&emsp;&emsp;***Input:*** nums = [1,1], target = 2<br>
28-
&emsp;&emsp;***Output:*** [0,1]
27+
>**Input:** nums = [1,1], target = 2\
28+
>**Output:** [0,1]
2929
3030

31-
***Constraints:***
31+
**Constraints:**
3232

3333
* ``2 <= nums.length <= 104``
3434
* ``-109 <= nums[i] <= 109``
3535
* ``-109 <= target <= 109``
36-
* ***Only one valid answer exists.***
36+
* **Only one valid answer exists.**

0 commit comments

Comments
(0)

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