weixin_51781547的博客

/** * Definition for singly-linked list. * struct ListNode { * int val; * struct ListNode *next; * }; *///初始化头和尾(yǐ)巴struct ListNode*head=NULL;struct ListNode*end=NULL;//定义一个增加节点的函数void addlist(int a){ struct ListNode*ptemp=(struct

#include<stdio.h>#include<stdlib.h>void swap(int arr[], int i, int j){int temp = arr[i];arr[i] = arr[j];arr[j] = temp;}void heapify(int tree[], int n, int i) //i表示的是要对哪个节点做操作，n表示由多少个节点{if (i >= n) //出口return;int c1 = 2 * i + 1;i