goodyang1的博客

题目： https://leetcode-cn.com/problems/reverse-string/submissions/ 代码： class Solution { public: void reverseString(vector& s) { int size = s.size(); char tmp; int i = 0, j = size - 1; w...

题目： https://leetcode-cn.com/problems/lowest-common-ancestor-of-a-binary-search-tree/solution/ 代码：/** Definition for a binary tree node. struct TreeNode { int val; TreeNode *left; TreeNode *rig...

题目：https://leetcode-cn.com/problems/reverse-words-in-a-string-iii/submissions/ 代码： class Solution { public: string reverseWords(string s) { int size = s.size(); string res; int i = 0; while (i <...

题目： https://leetcode-cn.com/problems/kth-largest-element-in-an-array/submissions/ 代码： class Solution { public: int findKthLargest(vector& nums, int k) { if(k < 0) return 0; int size = nums....

题目： https://leetcode-cn.com/problems/delete-node-in-a-linked-list/submissions/ 代码：/** Definition for singly-linked list. struct ListNode { int val; ListNode *next; ListNode(int x) : val(x)...

题目：https://leetcode-cn.com/problems/lowest-common-ancestor-of-a-binary-tree/submissions/ 代码：/** Definition for a binary tree node. struct TreeNode { int val; TreeNode *left; TreeNode *righ...

题目：https://leetcode-cn.com/problems/nim-game/submissions/ 代码： class Solution { public: bool canWinNim(int n) { int dim4 = n %4; if(dim4 == 0) return false; else { return true; } } };

题目： https://leetcode-cn.com/problems/product-of-array-except-self/submissions/ 代码： class Solution { public: vector productExceptSelf(vector & nums) { int size = nums.size(); if (size == 0) return...

题目：https://leetcode-cn.com/problems/lru-cache/submissions/ 代码：class LRUCache { public: LRUCache(int capacity) : _cap(capacity) {} // O(1) // hash 查找，如果找到了，就把 list 中的节点接下来移到头部 int get(int key) { au...

题目： https://leetcode-cn.com/problems/reverse-linked-list/submissions/ 代码：/** Definition for singly-linked list. struct ListNode { int val; ListNode *next; ListNode(int x) : val(x), next(NU...

题目： https://leetcode-cn.com/problems/power-of-two/submissions/ 代码： class Solution { public: bool isPowerOfTwo(int n) { if(n <= 0) return false; if((n&(n - 1)) == 0) return true;...

题目： https://leetcode-cn.com/problems/best-time-to-buy-and-sell-stock-ii/ 代码： int maxProfit(int* prices, int pricesSize){ if (!prices || pricesSize <= 1) return 0; int *buy=NULL, *sell=NULL, profit=...

题目： https://leetcode-cn.com/problems/sort-list/submissions/ 代码： /** Definition for singly-linked list. struct ListNode { int val; ListNode *next; ListNode(int x) : val(x), next(NULL) {} ...

题目： https://leetcode-cn.com/problems/min-stack/submissions/ 代码： class MinStack { private: vector<int> vec; public: /** initialize your data structure here. */ MinStack() { } void push(int x) {...

题目: https://leetcode-cn.com/problems/contains-duplicate/submissions/ 代码： class Solution { public: bool containsDuplicate(vector& nums) { int size = nums.size(); if(size <= 1) return false; int...

题目:https://leetcode-cn.com/problems/spiral-matrix-ii/ 代码： class Solution { public: vector<vector> generateMatrix(int n) { vector<vector<int>> matrix(n,vector<int>(n,0)); int i ...

题目：https://leetcode-cn.com/problems/rotate-list/ 代码： /** Definition for singly-linked list. struct ListNode { int val; ListNode *next; ListNode(int x) : val(x), next(NULL) {} }; / class...

题目： https://leetcode-cn.com/problems/unique-paths/submissions/ 代码： class Solution { public: int uniquePaths(int m, int n) { if(m <= 0 || n <=0) { return 0; } ...

题目： https://leetcode-cn.com/problems/subsets/submissions/ 代码： class Solution { public: vector<vector> subsets(vector& nums) { vector<vector> res; int size = nums.size(); for (int i = 0...

题目：https://leetcode-cn.com/problems/intersection-of-two-linked-lists/comments/ 代码： /** Definition for singly-linked list. struct ListNode { int val; ListNode *next; ListNode(int x) : val(x...

题目：https://leetcode-cn.com/problems/kth-smallest-element-in-a-bst/submissions/ 代码： /** Definition for a binary tree node. struct TreeNode { int val; TreeNode *left; TreeNode *right; Tre...

题目：https://leetcode-cn.com/problems/majority-element/submissions/ 代码：class Solution { public: int majorityElement(vector& nums) { int size = nums.size(); if(size == 0) { return...

题目：https://leetcode-cn.com/problems/linked-list-cycle/submissions/ 代码： /** Definition for singly-linked list. struct ListNode { int val; ListNode *next; ListNode(int x) : val(x), next(NULL...

这里写自定义目录标题欢迎使用Markdown编辑器新的改变功能快捷键合理的创建标题，有助于目录的生成如何改变文本的样式插入链接与图片如何插入一段漂亮的代码片生成一个适合你的列表创建一个表格设定内容居中、居左、居右SmartyPants创建一个自定义列表如何创建一个注脚注释也是必不可少的KaTeX数学公式新的甘特图功能，丰富你的文章UML 图表FLowchart流程图导出与导入导出导入 欢迎使用Ma...