Leetcode--Longest Substring Without Repeating Characters

class Solution {
public:
    int lengthOfLongestSubstring(string s) {
        int n = s.length();
        int i = 0, j = 0;
        int max_length = 0;
        int curr_length = 0;
        bool exit[256] = {false};
        while(j curr_length ? max_length : curr_length;
            
        }  
        return max_length;      
    }
};