qq_32555995的博客

暴力求解(求出所有可能的和) 复杂度O(N³)#include<stdio.h> #include<math.h> #include<string.h> int a[100001]; int main() { int N; scanf("%d", &N); for(int i = 0; i < N; i++) scanf("%d...

List Merge(List L1, List L2) { List L; List L3 = (PtrToNode)malloc(sizeof(struct Node)); L3->Next = NULL; List p = L1->Next; /*这里注意两个头结点的位置 L1->Next才是第一个元素结点，下同*/ List q = L2->Ne...

#include<stdio.h> #include<string.h> #include<stdlib.h> #include<math.h> typedef struct PloyNode *Ploynomial; struct PloyNode { int coef; int expon; Ploynomial link; }; ...

#include<iostream> #include<vector> using namespace std; #define MAX_ADDRESS_SIZE 100000 struct Node { int Address = -1; int Data = 0; int Next = -1; }; void reverse_linked_nodes(v...

#include<stdio.h> #include<iostream> #include<algorithm> #include<vector> #include<stack> using namespace std; int M, N, K; int Check(vector<int> &v) { stac...

1、利用C++特性：class Solution { public: /** * @param A an integer array * @return void */ void sortIntegers(vector<int>& A) { // Write your code here sort(A...