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 e615b47

Browse files
committed
Clean up description.md files.
1 parent 0baa236 commit e615b47

File tree

2 files changed

+7
-15
lines changed

2 files changed

+7
-15
lines changed

‎data/problems/LongestSubstringWithoutRepeatingCharacters/description.md

Lines changed: 6 additions & 10 deletions
Original file line numberDiff line numberDiff line change
@@ -1,29 +1,25 @@
11
# Longest Substring Without Repeating Characters
22

33
Given a string `s`, find the length of the longest substring that has no repeating characters.
4-
5-
6-
**Example 1:**\
4+
\
5+
\
6+
\
7+
**Example 1:**
78
>**Input:** s = "abcabcbb"\
89
>**Output:** 3\
910
>**Explanation:** The answer is "abc", with the length of 3.
1011
11-
12-
13-
**Example 2:**\
12+
**Example 2:**
1413
>**Input:** s = "bbbbb"\
1514
>**Output:** 1\
1615
>**Explanation:** The answer is "b", with the length of 1.
1716
18-
19-
20-
**Example 3:**\
17+
**Example 3:**
2118
>**Input:** s = "pwwkew"\
2219
>**Output:** 3\
2320
>**Explanation:** The answer is "wke", with the length of 3.\
2421
>Notice that the answer must be a substring, "pwke" is a subsequence and not a substring.
2522
26-
2723
**Constraints:**
2824

2925
* ``0 <= s.length <= 5 * 104``

‎data/problems/TwoSum/description.md

Lines changed: 1 addition & 5 deletions
Original file line numberDiff line numberDiff line change
@@ -14,23 +14,19 @@ You can return the answer in any order.
1414
>**Output:** [0,1]\
1515
>**Explanation:** Because nums[0] + nums[1] == 10, we return [0, 1].
1616
17-
1817
**Example 2:**
1918

2019
>**Input:** nums = [1,3,4], target = 7\
2120
>**Output:** [1,2]
2221
23-
24-
2522
**Example 3:**
2623

2724
>**Input:** nums = [1,1], target = 2\
2825
>**Output:** [0,1]
29-
3026
3127
**Constraints:**
3228

3329
* ``2 <= nums.length <= 104``
3430
* ``-109 <= nums[i] <= 109``
3531
* ``-109 <= target <= 109``
36-
* **Only one valid answer exists.**
32+
* **Only one valid answer exists.**

0 commit comments

Comments
(0)

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