Longest Substring Without Repeating Characters解题报告

使用双指针，i遍历全部字符，start收集重复的次数，最后不重复出现的字符个数maxx为i-start+1;

//

//  main.cpp

//  Longest Substring

//

//  Created by Bowie Hsu  on 14/11/21.

//  Copyright (c) 2014年 Bowie Hsu . All rights reserved.

//

 

#include <iostream>

#include <string>

#include <vector>

#include "stdio.h"

using namespace std;

 

 struct ListNode {

         int val;   //用将x的值赋给int型

         ListNode *next;

         ListNode(int x) : val(x), next(NULL) {}

     };

 

class Solution {

public:

public:

    ListNode *addTwoNumbers(ListNode *l1, ListNode *l2)

    {

        int forw=0;//进位标志

        //建立一个新的链表存储答案

        ListNode root(0);

        ListNode *output=&root;

        while(l1||l2)

        {

            int v1 = (l1 ? l1->val : 0);

            int v2 = (l2 ? l2->val : 0);

            int sum=v1+v2+forw;

            //检验sum是否为两位数

            forw=sum/10;

            sum=sum%10;

            ListNode *coNode=new ListNode(sum);

            output->next=coNode;

            output=coNode;

            if(l1)l1=l1->next;

            if(l2)l2=l2->next;

        }

        if(forw>0)

        {

            ListNode *coNode=new ListNode(forw);

            output->next=coNode;

            output=coNode;

        }

        return root.next;

    }

};

 

int main()

{

    Solution x;

    ListNode newpoint(0);

    ListNode *ans=&newpoint;

    ListNode *newpoint1=new ListNode(6);

    ListNode *newpoint2=new ListNode(7);   

    ans->next=x.addTwoNumbers(newpoint2,newpoint1);

    cout<<ans->next->next->val<<endl;  //程序成功，输出6+7=13中的十位数字1

}