【LeetCode算法练习（C语言）】Longest Substring Without Repeating Characters

题目：
Given a string, find the length of the longest substring without repeating characters.

Examples:
Given “abcabcbb”, the answer is “abc”, which the length is 3.
Given “bbbbb”, the answer is “b”, with the length of 1.
Given “pwwkew”, 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.

链接：Longest Substring Without Repeating Characters
解法：贪心，时间O(n^2)

int lengthOfLongestSubstring(char* s) {    int max_length = strlen(s);    int ans, begin = 0, end;    for (end = 0; end < max_length; end++) {        for (int i = begin; i < end; i++) {            if (s[i] == s[end]) begin = i + 1;        }        if (ans <= end - begin) ans = end - begin + 1;    }    return ans;}

Runtime: 25 ms