zoukankan      html  css  js  c++  java
  • Leetcode:Longest Substring Without Repeating Characters 解题报告

    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.

    SOLUTION 1:

    http://blog.csdn.net/imabluefish/article/details/38662827

    使用一个start来记录起始的index,判断在hash时 顺便判断一下那个重复的字母是不是在index之后。如果是,把start = map.get(c) + 1即可。并且即时更新

    char的最后索引。

     1 public class Solution {
     2     public int lengthOfLongestSubstring(String s) {
     3         if (s == null) {
     4             return 0;
     5         }
     6         
     7         int max = 0;
     8         HashMap<Character, Integer> map = new HashMap<Character, Integer>();
     9         
    10         int len = s.length();
    11         int l = 0;
    12         for (int r = 0; r < len; r++) {
    13             char c = s.charAt(r);
    14             
    15             if (map.containsKey(c) && map.get(c) >= l) {
    16                 l = map.get(c) + 1;
    17             }
    18             
    19             // replace the last index of the character c.
    20             map.put(c, r);
    21             
    22             // replace the max value.
    23             max = Math.max(max, r - l + 1);
    24         }
    25         
    26         return max;
    27     }
    28 }
    View Code

    SOLUTION 2:

    假定所有的字符都是ASCII 码,则我们可以使用数组来替代Map,代码更加简洁。

     1 public int lengthOfLongestSubstring(String s) {
     2         if (s == null) {
     3             return 0;
     4         }
     5         
     6         int max = 0;
     7         
     8         // suppose there are only ASCII code.
     9         int[] lastIndex = new int[128];
    10         for (int i = 0; i < 128; i++) {
    11             lastIndex[i] = -1;
    12         }
    13         
    14         int len = s.length();
    15         int l = 0;
    16         for (int r = 0; r < len; r++) {
    17             char c = s.charAt(r);
    18             
    19             if (lastIndex[c] >= l) {
    20                 l = lastIndex[c] + 1;
    21             }
    22             
    23             // replace the last index of the character c.
    24             lastIndex[c] = r;
    25             
    26             // replace the max value.
    27             max = Math.max(max, r - l + 1);
    28         }
    29         
    30         return max;
    31     }
    View Code

     

    GITHUB:
    https://github.com/yuzhangcmu/LeetCode_algorithm/blob/master/string/LengthOfLongestSubstring.java

  • 相关阅读:
    AliSQL的编译使用
    linux下编译gcc6.2.0
    TransmitFile函数的简单使用
    C++11的简单线程池代码阅读
    TJpgDec使用说明
    TJpgDec—轻量级JPEG解码器
    PPM图片格式及其C读写代码
    linux下vmware的安装、物理分区使用及卸载
    visual stuido 跨解决方案调试
    Proj.4坐标系统创建参数
  • 原文地址:https://www.cnblogs.com/yuzhangcmu/p/4188973.html
Copyright © 2011-2022 走看看