Movatterモバイル変換


[0]ホーム

URL:


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

Commit116daaa

Browse files
refactor 159
1 parent459215b commit116daaa

File tree

1 file changed

+0
-14
lines changed
  • src/main/java/com/fishercoder/solutions

1 file changed

+0
-14
lines changed

‎src/main/java/com/fishercoder/solutions/_159.java

Lines changed: 0 additions & 14 deletions
Original file line numberDiff line numberDiff line change
@@ -3,20 +3,6 @@
33
importjava.util.HashMap;
44
importjava.util.Map;
55

6-
/**
7-
* 159. Longest Substring with At Most Two Distinct Characters
8-
* Given a string s , find the length of the longest substring t that contains at most 2 distinct characters.
9-
*
10-
* Example 1:
11-
* Input: "eceba"
12-
* Output: 3
13-
* Explanation: t is "ece" which its length is 3.
14-
*
15-
* Example 2:
16-
* Input: "ccaabbb"
17-
* Output: 5
18-
* Explanation: t is "aabbb" which its length is 5.
19-
*/
206
publicclass_159 {
217
publicstaticclassSolution1 {
228
publicintlengthOfLongestSubstringTwoDistinct(Strings) {

0 commit comments

Comments
 (0)

[8]ページ先頭

©2009-2025 Movatter.jp