【C语言Coding】第二十八天

int maximumNumberOfStringPairs(char ** words, int wordsSize){
    int ans = 0;
    for(int i=0;i

// 得到四个参数
void getNumber(int* arr, char* num1){
    int flag1=0;
    int i=0;
    if(num1[i] == '-'){
        flag1 = 1;i++;
    }
    int a = num1[i]-'0';
    i++;
    while(num1[i]!='+'){
        a=a*10;
        a+=(num1[i])-'0';
        i++;
    }
    //跳过+号
    i++;
    int flag2 = 0; // 需不需要-号
    if(num1[i] == '-') {
        flag2=1;i++; //跳过负号
    }
    int b = num1[i]-'0';
    i++;
    while(num1[i]!='i'){
        b=b*10;
        b+=(num1[i])-'0';
        i++;
    }
    arr[0] = flag1==1?-a:a;
    arr[1] = flag2==1?-b:b;
}
//得到结果字符串
void getStr(char* str,int L,int R){
    int start = 10000;
    int i = 0;
    if(L

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     struct ListNode *next;
 * };
 */
struct ListNode* mergeNodes(struct ListNode* head){
    struct ListNode* O = head;
    struct ListNode* L = head;
    struct ListNode* R = head->next;
    while(R!=NULL){
        while(R->next->val!=0){
            // 下一个位置 不为0  将值累加
            R->next->val += R->val;
            R=R->next;   
        }
        // 找到0服务器托管网位置，将结果保存在0位置上
        R->next->val = R->val;
        R=R->next;
        L->next = R;
        L = R;// 调整指针
        R = L->next;
    }
    return O->next;
}

struct Node{
    int val; // 序号 1 - n
    struct Node* next; 
};

//类约瑟夫问题
int findTheWinner(int n, int k){
    if(n == 1) return 1;
    if(n == 2) return k%2==0?1:2;
    if(k == 1) return n;
    //循环链表
    struct Node * head = (struct Node*)malloc(sizeof(struct Node));
    struct Node * R = head;
    R->val = 1;
    for(int i=2;ival = i; // 序号值
        R->next = node; // R的下一个结点
        R = node; // R进入下一个结点
        node->next = head; // 循环链表
    }
    int i=0;
    //以R结点为起始点，判断下一个点是否为需要删去的点
    //直到剩下最后一个点
    while(1){
        i++;
        if(i%k==0){
            R->next = R->next->next;
            continue;
        }
        if(R->next == R){
            return R->val;
        }
        R = R->next;
    }
    return -1;
}

/**
 * Note: The returned array must be malloced, assume caller calls free().
 */
int* executeInstructions(int n, int* startPos, int startPosSize, char * s, int* returnSize){
    int len = strlen(s);
    int* ans = (int*)malloc(sizeof(int)*len);
    *returnSize = len;
    for(int i=0;i=n || y=n) break;      
            count++;
        }
        ans[i] = count;
    }
    return ans;
}