FilesExpand file tree

main

/

03-longest-substring.cpp

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

64 lines (47 loc) · 1.24 KB

main

/

03-longest-substring.cpp

Copy path

Top

File metadata and controls

• Code
• Blame

64 lines (47 loc) · 1.24 KB

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

18

19

20

21

22

23

24

25

26

27

28

29

30

31

32

33

34

35

36

37

38

39

40

41

42

43

44

45

46

47

48

49

50

51

52

53

54

55

56

57

58

59

60

61

62

63

64

/*

Given a string s, find the length of the longest substring without duplicate characters.

Example 1:

Input: s = "abcabcbb"

Output: 3

Explanation: The answer is "abc", with the length of 3.

Example 2:

Input: s = "bbbbb"

Output: 1

Explanation: The answer is "b", with the length of 1.

Example 3:

Input: s = "pwwkew"

Output: 3

Explanation: The answer is "wke", with the length of 3.

Notice that the answer must be a substring, "pwke" is a subsequence and not a substring.

Constraints:

0 <= s.length <= 5 * 104

s consists of English letters, digits, symbols and spaces.

*/

#include <iostream>

#include <vector>

#include <cctype>

using namespace std;

class Solution {

public:

int lengthOfLongestSubstring(string s) {

std::string r = "";

int biggestStr = 0;

for (char c : s){

size_t pos = r.find(c);

if (pos != std::string::npos) {

r = r.substr(pos + 1);

}

r += c;

if (r.size() > biggestStr){

biggestStr = r.size();

}

}

return biggestStr;

}

};

int main() {

Solution sol;

int res = sol.lengthOfLongestSubstring("abcd");

std::cout << res << " ";

return 0;

}