aboutsummaryrefslogtreecommitdiff
path: root/other/longest_substring_no_repeat.cpp
diff options
context:
space:
mode:
authorJack Sangdahl <[email protected]>2025-06-27 12:23:02 -0600
committerJack Sangdahl <[email protected]>2025-06-27 12:23:02 -0600
commita96b65cbfad7f62f3db6b2eab105e4e25c0414c5 (patch)
treee2a2b3f49f9fb741be81415266ac93e74cff42ec /other/longest_substring_no_repeat.cpp
parent694ad5ed71edcb1deccab54b72d706b779918276 (diff)
downloadleetcode-a96b65cbfad7f62f3db6b2eab105e4e25c0414c5.tar.gz
leetcode-a96b65cbfad7f62f3db6b2eab105e4e25c0414c5.zip
chore: remove old cpp and rust solutions
Diffstat (limited to 'other/longest_substring_no_repeat.cpp')
-rw-r--r--other/longest_substring_no_repeat.cpp29
1 files changed, 0 insertions, 29 deletions
diff --git a/other/longest_substring_no_repeat.cpp b/other/longest_substring_no_repeat.cpp
deleted file mode 100644
index 0735fc7..0000000
--- a/other/longest_substring_no_repeat.cpp
+++ /dev/null
@@ -1,29 +0,0 @@
-#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);
-}