GallantZhangYu的博客

单词： duplicate相同的数 Sort有序 Array数组思路： 1.Allocate extra space for another array#include <iostream>#include <vector>using namespace std;class SortedArray{public: void Print(vector<int> &nums

思路：加入一个变量来记录元素出现的次数方法一：class A{public: int Remove(int *a,int len) { if(a==NULL||len<0) return 0; if(len<=2) return len; int index=2; f

题意： You are given two linked lists representing two non-negative numbers. The digits are stored in reverse order and each of their nodes contain a single digit. Add the two numbers and return it as a

说明： Reverse a linked list from position m to n. Do it in-place and in one-pass. For example: Given 1->2->3->4->5->nullptr, m = 2 and n = 4, return 1->4->3->2->5->nullptr. Note: Given m, n satisfy t

单词：partition 分割 说明： Given a linked list and a value x, partition it such that all nodes less than x come before nodes greater than or equal to x. You should preserve the original relative order of

说明： Given a sorted linked list, delete all duplicates such that each element appear only once. For example, Given 1->1->2, return 1->2. Given 1->1->2->3->3, return 1->2->3. 代码：/*******************

单词： Preorder 前序，先序 Traversal 遍历 思路： 栈容器 先将根压入栈，用节点保存头元素，当栈容器不为空时 //遍历 while(!B.empty()) { //节点保存头元素； p=B.top(); //将头元素的数据压入vector容器； result.push_back(p->data); //头元素出栈；

单词： inorder 中序 Traversal 遍历代码：#include <iostream>#include<vector>#include<stack>using namespace std;//数的结构体typedef struct _BiNode{ //数据 int data; //左孩子 struct _BiNode* lChild;