Add solution of: 003 Longest Substring Without Repeating Characters

Author: chanthuang

README.md

@@ -5,6 +5,8 @@ LeetCode
 |----|--------|---------|-------|
 |1|[Two Sum][1]|[JavaScript](./solution/001.Two_Sum/Solution.js)|Easy|
 |2|[Add Tow Numbers][2]|[JavaScript](./solution/002.Add_Two_Numbers/Solution.js)|Medium|
+|3|[Longest Substring Without Repeating Characters][3]|[JavaScript](./solution/003.Longest_Substring_Without_Repeating_Characters/Solution.js)|Medium|
 
 [1]:https://leetcode.com/problems/two-sum/
 [2]:https://leetcode.com/problems/add-two-numbers/
+[3]:https://leetcode.com/problems/longest-substring-without-repeating-characters/

solution/003.Longest_Substring_Without_Repeating_Characters/Solution.js

@@ -0,0 +1,39 @@
+/**
+ * @param {string} s
+ * @return {number}
+ */
+var lengthOfLongestSubstring = function(s) {
+	var maxLength = 0;
+	for (var i = 0; i < s.length; i++) {
+		if (s.length - i <= maxLength) break;
+		var map = {};
+		var length = 0;
+		for (var j = i; j < s.length; j++) {
+			var charCode = s.charCodeAt(j);
+			if (map[charCode] !== null && map[charCode] !== undefined) {
+				break;
+			}
+			map[charCode] = j;
+			length++;
+		}
+		if (length > maxLength) maxLength = length;
+		// console.log('from index(' + i + ') maxLength = ' + length + ', substr = ' + s.substr(i, length));
+	}
+	return maxLength;
+};
+
+// test
+function test() {
+	var testString = "abcabcbb";
+	console.log('string = ' + testString);
+	console.log('index  = ' + (function(s){
+		var s = "";
+		for (var i = 0; i < s.length; i++) {
+			s += i;
+		};
+		return s;
+	})(testString));
+	console.log("length = " + lengthOfLongestSubstring(testString));
+}
+
+test();