代码改变世界

leetcode - Longest Substring Without Repeating Characters

2013-04-26 16:00  张汉生  阅读(183)  评论(0)  编辑  收藏  举报

题目描述：点击此处

 1 class Solution {
 2 public:
 3   int lengthOfLongestSubstring(string s) {
 4     // Start typing your C/C++ solution below
 5     // DO NOT write int main() function
 6     int rlt = 0;
 7     string cur = "";
 8     int len = s.length();
 9     for (int i=0; i<len; i++){
10       int j;
11       for (j=cur.length()-1; j>=0; j--)
12         if (cur.at(j)==s.at(i))
13           break;
14       cur = cur.substr(j+1, cur.length()-j-1) + s.at(i);
15       if (cur.length() > rlt)
16         rlt = cur.length();
17     }
18     return rlt;
19   }
20 };