![](https://img-blog.csdnimg.cn/20201217095733431.jpg?x-oss-process=image/resize,m_fixed,h_224,w_224)
LeetCode
LeetCode练习记录,仅仅记录,没有详解
Eva_5433
人生没有白走的路,每一步它都算数——考研政治老师孔昱力
展开
-
【LeetCode】剑指 Offer 06. 从尾到头打印链表
剑指 Offer 06. 从尾到头打印链表/** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * ListNode(int x) : val(x), next(NULL) {} * }; */class Solution {public: vector<int> reversePrint(ListNode* h原创 2021-01-19 17:48:45 · 38 阅读 · 0 评论 -
【LeetCode】728. 自除数
728. 自除数class Solution {public: vector<int> selfDividingNumbers(int left, int right) { vector<int> ans; for(int i=left; i<=right; ++i){ int k = i; vector<int> v; while(k){原创 2021-01-19 17:40:37 · 38 阅读 · 0 评论 -
【LeetCode】剑指 Offer 54. 二叉搜索树的第k大节点
剑指 Offer 54. 二叉搜索树的第k大节点/** * Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; */class Solution {public: in原创 2021-01-18 18:50:27 · 63 阅读 · 0 评论 -
【LeetCode】剑指 Offer 10- II. 青蛙跳台阶问题 70. 爬楼梯
剑指 Offer 10- II. 青蛙跳台阶问题70. 爬楼梯class Solution {public: int numWays(int n) { int pre = 1, prePre = 1; int cur = 1; int mod = 1e9+7; for(int i=2; i<=n; i++){ cur = (pre + prePre)%mod; pre原创 2021-01-17 23:03:32 · 72 阅读 · 0 评论 -
【LeetCode】1323. 6 和 9 组成的最大数字
1323. 6 和 9 组成的最大数字class Solution {public: int maximum69Number (int num) { stack<int> s; int anw = 0; while(num){ int k = num % 10; num = num / 10; s.push(k); } boo原创 2021-01-17 21:09:40 · 79 阅读 · 0 评论 -
【LeetCode】剑指 Offer 24. 反转链表 206. 反转链表
剑指 Offer 24. 反转链表206. 反转链表/** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * ListNode(int x) : val(x), next(NULL) {} * }; */class Solution {public: ListNode* reverseList(ListNode* hea原创 2021-01-11 13:55:43 · 55 阅读 · 0 评论 -
【LeetCode】24. 两两交换链表中的节点
24. 两两交换链表中的节点/** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * ListNode() : val(0), next(nullptr) {} * ListNode(int x) : val(x), next(nullptr) {} * ListNode(int x, ListNode *next) :原创 2021-01-06 19:11:40 · 52 阅读 · 0 评论 -
【LeetCode】445. 两数相加 II
445. 两数相加 II/** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * ListNode(int x) : val(x), next(NULL) {} * }; */class Solution {public: ListNode* addTwoNumbers(ListNode* l1, ListNode* l2)原创 2021-01-05 11:01:06 · 49 阅读 · 0 评论 -
【LeetCode】剑指 Offer 35. 复杂链表的复制
剑指 Offer 35. 复杂链表的复制/*// Definition for a Node.class Node {public: int val; Node* next; Node* random; Node(int _val) { val = _val; next = NULL; random = NULL; }};*/class Solution {public: Nod原创 2021-01-04 19:09:05 · 71 阅读 · 0 评论 -
【LeetCode】61. 旋转链表
61. 旋转链表/** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * ListNode() : val(0), next(nullptr) {} * ListNode(int x) : val(x), next(nullptr) {} * ListNode(int x, ListNode *next) : val(.原创 2021-01-03 23:39:32 · 58 阅读 · 0 评论 -
【LeetCode】430. 扁平化多级双向链表
430. 扁平化多级双向链表/*// Definition for a Node.class Node {public: int val; Node* prev; Node* next; Node* child;};*/class Solution {public: Node* flatten(Node* head) { if(!head){ return NULL; }原创 2021-01-02 09:29:47 · 62 阅读 · 0 评论 -
【LeetCode】剑指 Offer 22. 链表中倒数第k个节点
剑指 Offer 22. 链表中倒数第k个节点/** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * ListNode(int x) : val(x), next(NULL) {} * }; */class Solution {public: ListNode* getKthFromEnd(ListNode* head,原创 2021-01-02 08:23:38 · 53 阅读 · 0 评论 -
【LeetCode】面试题 02.02. 返回倒数第 k 个节点
面试题 02.02. 返回倒数第 k 个节点/** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * ListNode(int x) : val(x), next(NULL) {} * }; */class Solution {public: int kthToLast(ListNode* head, int k) {原创 2021-01-02 08:16:49 · 172 阅读 · 0 评论 -
【LeetCode】剑指 Offer 10- I. 斐波那契数列
剑指 Offer 10- I. 斐波那契数列class Solution {public: int fib(int n) { int a[105]; int k = 1000000007; a[0] = 0; a[1] = 1; for(int i=2; i<=n; ++i){ a[i] = (a[i-1]+a[i-2])%k; } return原创 2020-12-31 14:41:52 · 49 阅读 · 0 评论 -
【LeetCode】704. 二分查找
704. 二分查找class Solution {public: int search(vector<int> &nums, int target) { int left, right, mid; left = 0; right = nums.size() - 1; while (left <= right) { mid = (left + right) / 2;原创 2020-12-17 09:45:55 · 88 阅读 · 0 评论