Longest Substring Without Repeating Characters
Given a string, find the length of the longest substring without repeating characters.
Example 1:
Input: "abcabcbb"
Output: 3
Explanation: The answer is "abc", with the length of 3.
Example 2:
Input: "bbbbb"
Output: 1
Explanation: The answer is "b", with the length of 1.
Example 3:
Input: "pwwkew"
Output: 3
Explanation: The answer is "wke", with the length of 3.
Note that the answer must be a substring, "pwke" is a subsequence and not a substring.
Solution 1:
public class Solution {
public int LengthOfLongestSubstring(string s) {
var result = 0;
var currentResult = result;
var resultStr = "";
var currentResultStr = "";
for(var i = 0; i < s.Length; i++){
var current = s.Substring(i,1);
if( !currentResultStr.Contains(current)){
currentResultStr += current;
currentResult ++;
}else{
var index = currentResultStr.IndexOf(current);
currentResultStr = currentResultStr.Substring(index+1) + current;
currentResult = currentResultStr.Length;
}
if( result <= currentResult ){
result = currentResult;
resultStr = currentResultStr;
}
}
return result;
}
}