leetcode_C/92.c at main · mouyuanyap/leetcode_C · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
#include <stdio.h>
#include <stdlib.h>
#include <stdbool.h>
#include "linkedListlib.h"

struct ListNode* reverseBetween(struct ListNode* head, int left, int right){
    struct ListNode* move = head;
    struct ListNode* prev = move;
    for(int i = 0; i < left-1; i++){
        prev = move;
        move = move->next;
    }
    struct ListNode* start,*start2;
    if(!move->next){
        return head;
    }else if (prev != move){
        start = prev;
        start2 = move;
    }else{
        start = NULL;
        start2 = move;
    }


    if (move){
        struct ListNode* temp = move->next;

        move->next = NULL;
        prev = move;
        move = temp;
        for(int i = 0; i < right-left; i++){
            if(!move)break;
            temp = move->next;
            move->next = prev;
            prev = move;
            move = temp;
        }
    }
    if (start){
        start->next = prev;

    }else{
        start = prev;
        head = start;
        // return start;


    }
    if (move) start2->next = move;

    return head;
}

int main(){
    int l1[] = {1,2,3,4,5,6};
    struct ListNode* list1 = createList(l1,sizeof(l1)/sizeof(l1[0]));
    struct ListNode* list2 = reverseBetween(list1, 1, 2);
}