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

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

    Example 1:

    Input: "abcabcbb"
    Output: 3
    Explanation: The answer is "abc", with the length of 3.
    Example 2:

    Input: "bbbbb"
    Output: 1
    Explanation: The answer is "b", with the length of 1.
    Example 3:

    Input: "pwwkew"
    Output: 3
    Explanation: 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.

    c++ 思路:二重循环,进行在线处理,如果,str中不包含字符,则进行追加字符串操作,否则跳出内层循环。若比已知来的打,那么更新max。

    class Solution {
    public:
        int lengthOfLongestSubstring(string s) {
            int max=0;string str="";
            for(int i=0;i<s.length();i++){
                str="";
                for(int j=i;j<s.length();j++)
                    if(str.find(s[j])==str.npos) str+=s[j];
                    else break;
                if(str.length()>max) max=str.length();
            }
            return max;
        }
    };
  • 相关阅读:
    再谈树形dp
    洛谷 P3627 [APIO2009]抢掠计划
    树状数组
    树形dp 入门
    洛谷P2014 选课
    洛谷P2015 二叉苹果树
    9 vue.js 被观察数组的变异方法
    8 vue的v-model指令学习
    7vue-事件修饰符
    6.vue事件绑定-click
  • 原文地址:https://www.cnblogs.com/littlepage/p/12117587.html
Copyright © 2011-2022 走看看