二. leetcode_中等难度_1

    leetcode中等难度贴，每个帖子5题。

2. 链表加法

    给出两个 非空 的链表用来表示两个非负的整数。其中，它们各自的位数是按照 逆序 的方式存储的，并且它们的每个节点只能存储 一位 数字。如果，我们将这两个数相加起来，则会返回一个新的链表来表示它们的和。您可以假设除了数字 0 之外，这两个数都不会以 0 开头。

/*方法一：类似手写计算，35分钟写完，20ms;7.4m*/
void check(int* num, int* flag)
{
	if(*num >= 10)
	{
		*num -= 10;
		*flag = 1;
	}else
        *flag = 0;
}

struct ListNode* addTwoNumbers(struct ListNode* l1, struct ListNode* l2){
    struct ListNode *h = NULL, *k = NULL, *t = NULL; //new List

    h = t = (struct ListNode*)malloc(sizeof(struct ListNode)); // tail
    struct ListNode *p = l1, *q = l2; 
    int flag = 0;

    t->val = p->val + q->val;
    t->next = NULL;
    check(&t->val, &flag);
    p = p->next; q = q->next;

    while(p != NULL && q != NULL)
    {
        k = (struct ListNode*) malloc(sizeof(struct ListNode));
        k->val = p->val + q->val + flag;
        k->next = NULL;
        check(&k->val, &flag);
        
        t->next = k; t = t->next;
        p = p->next; q = q->next;
    }    
    while(p != NULL)
    {
        k = (struct ListNode*) malloc(sizeof(struct ListNode));
        k->val = p->val + flag;
        k->next = NULL;
        check(&k->val, &flag);

        t->next = k; t = t->next;
        p = p->next;
    }
    while(q != NULL)
    {
        k = (struct ListNode*) malloc(sizeof(struct ListNode));
        k->val = q->val + flag;
        k->next = NULL;
        check(&k->val, &flag);

        t->next = k; t = t->next;
        q = q->next;    
    }
    
    if(flag == 1)
    {
        k = (struct ListNode*) malloc(sizeof(struct ListNode));
        k->val = 1;
        k->next = NULL;
        t->next = k;
    }

    return h;
}

/*方法二：一开始创建好节点；有了第一次的基础，13分钟写完；16ms，7.3m*/
int getlen(struct ListNode* l)
{
	struct ListNode* p = l;
    int len = 0;
    while(p != NULL)
    {
        p = p->next;
        len++;
    }
    return len;
}

int max(a, b)
{
    if(a > b) return a;
    return b;
}

void check(int *num, int *flag)
{
    if(*num >= 10)
    {
        *num -= 10;
        *flag = 1;
    }else
        *flag = 0;
}

struct ListNode* addTwoNumbers(struct ListNode* l1, struct ListNode* l2){
    int len = max(getlen(l1), getlen(l2));
    struct ListNode *h = NULL, *t = NULL;
    h = t = (struct ListNode*)malloc(sizeof(struct ListNode));
    h->next = NULL;
    
    struct ListNode *k = NULL;
    int i = 0;
    for(i = 0; i < len - 1; i++)
    {
        k = (struct ListNode*)malloc(sizeof(struct ListNode));
        k->next = NULL;

        t->next = k; t = t->next;
    }

    struct ListNode *q = l1, *p = l2;
    int flag = 0;
    t = h;
    while(q != NULL && p != NULL)
    {
        t->val = q->val + p->val + flag;
        check(&t->val, &flag);
        t = t->next; q = q->next; p = p->next;
    }
    while(q != NULL)
    {
        t->val = q->val + flag;
        check(&t->val, &flag);
        t = t->next; q = q->next;
    }
    while(p != NULL)
    {
        t->val = p->val + flag;
        check(&t->val, &flag);
        t = t->next; p = p->next;
    }
    if(flag == 1)
    {
        k = (struct ListNode*)malloc(sizeof(struct ListNode));
        k->val = 1;
        k->next = NULL;
        t = h;
        while(t->next != NULL)
            t = t->next;
        t->next = k;
    }
    return h;
}

3. 给定一个字符串，请你找出其中不含有重复字符的 最长子串 的长度。

int inSubString(char *s, int i, int left, int right)
{
    int j = 0;
    for(j = right; j >= left; j--)
        if(s[i] == s[j])
            return j;
    return -1;
}

int lengthOfLongestSubstring(char * s){
    int longest = 1;
    int left = 0, right = 0;

    int i = 0;
    int pos = 0;
    int nowLongest = 0;
    if(s[0] == '\0') return 0;
    for(i = 1; s[i] != '\0'; i++)
    {
        pos = inSubString(s, i, left, right);
        if(pos < 0) // s[i] in s[left, right], return r, s[i] == s[r]
            right++;
        else
        {
            left = pos + 1;
            right++;
        }
        nowLongest = right - left + 1;
        if(nowLongest > longest)
            longest = nowLongest;
    }
    return longest;
}