aboutsummaryrefslogtreecommitdiff
path: root/other/longest_substring_no_repeat.cpp
diff options
context:
space:
mode:
Diffstat (limited to 'other/longest_substring_no_repeat.cpp')
-rw-r--r--other/longest_substring_no_repeat.cpp29
1 files changed, 29 insertions, 0 deletions
diff --git a/other/longest_substring_no_repeat.cpp b/other/longest_substring_no_repeat.cpp
new file mode 100644
index 0000000..0735fc7
--- /dev/null
+++ b/other/longest_substring_no_repeat.cpp
@@ -0,0 +1,29 @@
+#include "leetcode.h"
+
+class Solution {
+public:
+ int lengthOfLongestSubstring(string s) {
+ if (s.size() == 0)
+ return 0;
+ map<char, int> charsInSub;
+ int ans = 0, j = 0;
+ for (int i = 0; i < s.size(); ++i) {
+ if (charsInSub.find(s[i]) != charsInSub.end())
+ charsInSub.find(s[i])->second++;
+ else
+ charsInSub.insert(pair<char, int>(s[i], 1));
+ while (charsInSub.find(s[i])->second > 1) {
+ charsInSub.find(s[j])->second--;
+ ++j;
+ }
+ ans = ans >= i - j + 1 ? ans : i - j + 1;
+ }
+ return ans;
+ }
+};
+
+int main() {
+ Solution obj;
+ string s = "abcabcbb";
+ cout << obj.lengthOfLongestSubstring(s);
+}