勇敢牛牛，不怕困难！

分类

题解(20)

/ 注册

全部文章（共20篇）

题解 | #链表中环的入口结点#

/* struct ListNode { int val; struct ListNode *next; ListNode(int x) : val(x), next(NULL) { } }; */ class Solution { public: ...

C++

2021-09-28

0 415

题解 | #有序数组删除重复数字#

class Solution { public: int removeDuplicates(int A[], int n) { // boundary case if (!n) return 0; int k = 0; for (int i = 1; i <...

C++ 双指针

2021-09-28

0 471

题解 | #转动链表#

/** * struct ListNode { * int val; * struct ListNode *next; * }; */ class Solution { public: ListNode* rotateRight(ListNode* head, int k...

C++ 链表模拟

2021-09-28

0 450

题解 | #删除元素#

class Solution { public: int removeElement(int A[], int n, int elem) { int k = 0; for (int i = 0; i < n; ++i) if (A[i] != elem) A[k...

C++ 双指针

2021-09-27

1 432

题解 | #和为S的两个数字#

class Solution { public: vector<int> FindNumbersWithSum(vector<int> array,int target) { vector<int> ans(2); int min_produ...

C++ 双指针

2021-09-26

0 387

题解 | #拷贝有随机指针的链表#

/** * Definition for singly-linked list with a random pointer. * struct RandomListNode { * int label; * RandomListNode *next, *random; * ...

C++ 链表

2021-09-26

0 446

题解 | #词语序列#

class Solution { public: int ladderLength(string start, string end, unordered_set<string> &dict) { if (!dict.count(end)) return 0; ...

C++ 广度优先搜索

2021-09-25

0 507

题解 | #二叉搜索树的后序遍历序列#

class Solution { public: bool VerifySquenceOfBST(vector<int> sequence) { return verify(sequence, 0, sequence.size() - 1); } private: ...

C++ 排序树分治

2021-09-25

0 364

题解 | #出现一次的数字#

class Solution { public: /** * * @param A int整型一维数组 * @param n int A数组长度 * @return int整型 */ int singleNumber(int* A...

C++

2021-09-25

1 471

题解 | #重排链表#

const int N = 1e4; typedef struct ListNode* NodePtr; void reorderList(NodePtr head ) { // corrner case if (!head || !head->next) return; ...

C

2021-09-24

1 509