zoukankan      html  css  js  c++  java
  • leetcode:Longest Substring Without Repeating Characters

    Given a string, find the length of the longest substring without repeating characters. For example, the longest substring without repeating letters for "abcabcbb" is "abc", which the length is 3. For "bbbbb" the longest substring is "b", with the length of 1.

    解决方法(java版)

    class Solution{
        public int lengthOfLongestSubstring(String s) {
            String str=new String();
            str="";
            int max=0;
            for(int i=0;i<s.length();i++){
             for(int j=i;j<s.length();j++){
              if(str.contains(String.valueOf(s.charAt(j)))){
               break;
              }
              else{
               str+=s.charAt(j);
              }
               }
      if(str.length()>max)
        max=str.length();
      str="";
           }
            return max;
        }
    }

  • 相关阅读:
    MySQL命令2
    MySQL命令1
    前端之HTML1
    linux命令之df dh
    python call java jar
    redis-py中的坑
    YARN应用程序的开发步骤
    Yarn的服务库和事件库使用方法
    SSH无密码验证
    在centos 6.5 在virtual box 上 安装增强版工具
  • 原文地址:https://www.cnblogs.com/zhaolizhen/p/3349771.html
Copyright © 2011-2022 走看看