LeetCode(3) Longest Substring Without Repeating Characters

LeetCode的第3题，给定一个字符串，找到其中的一个最长的字串，使得这个子串不包含重复的字符。
Given a string S, find the longest palindromic substring in S. You may assume that the maximum length of S is 1000, and there exists one unique longest palindromic substring.

public class Solution {
    public int lengthOfLongestSubstring(String s) {
        int length = s.length();
        int i=0,j=1;
        int maxlen=0;
        while(j<length){
             if(s.charAt(i)!=s.charAt(j)){
                 j++;
             }else{
                maxlen = max(maxlen,j-i);
                i++;
                j++;
            }
        }
        return maxlen;
    }
    private int max(int maxlen,int i){
                int temp;
        if(maxlen>=i)
            temp = maxlen;
        else
            temp = i;
        return temp;
    }
}