- 博客(30)
- 资源 (1)
- 收藏
- 关注
RSS订阅转载 LeetCode 题目难度及通过率（1-900）（转）
转自 https://github.com/grandyang/leetcode题号 Title Solution Difficulty900 RLE Iterator 50.50% Medium899 Orderly Queue 47.70% Hard898 Bitwise ORs of Subarrays 34.70% Medium897 Increasing Order Searc...
2019-09-06 09:36:24
1898
原创 leetcode reverse list
#include<iostream>using namespace std;class solution{public: ListNode reverse(ListNode* head){ ListNode *dummpy = new ListNode(-1); ListNode *pre = head; ListNode *cur = head->...
2019-09-05 23:44:20
113
原创 leetcode no48_rotateImage
#include<iostream>#include<vector>using namespace std;class Solution{public: void rotate(vector<vector<int>> &matrix){ if(matrix.empty()){ return ; } int l...
2019-09-01 00:10:53
129
原创 subsetII
#include<iostream>#include<vector>using namespace std;class Solution {public: vector<vector<int>> subsets(vector<int>& nums) { vector<vector<int>>...
2019-08-28 23:36:13
159
原创 堆排序c++
include<stdio.h> //调整堆，保持大顶堆的性质,参数i指向根结点void maxHeap(int *a,int n,int i){ //left、right、largest分别指向 //左孩子、右孩子、{a[i],a[left]}中最大的一个 int left,right,largest; largest=left=2*i; if(left>n)...
2019-08-11 22:06:19
88
转载 leetcode 236 Lowest Common Ancestor of a Binary Tree
*https://segmentfault.com/a/1190000009429876首先要先确定给的两个node是否都在tree里，如果都在tree里的话，就可以分成3种情况，第一种情况是两个节点是在公共祖先的左右两侧，第二种情况是都在树的左侧，第三种情况是都在树的右侧，如果是第二，第三种情况的话，公共祖先就在给定的两个点中比较上面的那一个。如果转换成代码的话，从上往下走，base...
2019-07-31 23:25:49
80
转载 leetcode 33 Search in Rotated Sorted Array
#include<iostream>#include<vector>using namespace std;class Solution{public: int search(vector<int> &nums,int target){ int left = 0; int right = nums.size()-1; //...
2019-07-31 23:07:49
67
转载 leetcode 59 Spiral Matrix II
#include<iostream>#include<vector>using namespace std;class Solution {public: vector<vector<int>> generateMatrix(int n) { vector<vector<int>> res(n,vector&...
2019-07-29 23:29:10
96
转载 leetcode 59 Spiral Matrix II
#include<iostream>#include<vector>using namespace std;class Solution {public: vector<vector<int>> generateMatrix(int n) { vector<vector<int>> res(n,vector&...
2019-07-29 23:24:45
73
转载 leetcode 54 spiralMatrix
#include<iostream>#include<vecotr>using namespace std;class Solution {public: vector<int> spiralOrder(vector<vector<int>>& matrix) { vector<int> res...
2019-07-29 23:22:01
114
转载 leetcode110. Balanced Binary Tree
#include<iostrem>#include<algorithm>#include<cstdlib>using namespace std;struct TreeNode { int val; TreeNode *left; TreeNode *right; TreeNode(int x) : val(x), l...
2019-07-29 23:02:41
59
转载 leetcode 102 Binary Tree Level Order Traversal
#include<iostream>#include<queue>using namespace std;struct TreeNode { int val; TreeNode *left; TreeNode *right; TreeNode(int x) : val(x), left(NULL), right(NULL) {}}...
2019-07-29 22:02:36
72
转载 快速排序
package leetcode.sort;import java.util.Arrays;/*https://blog.csdn.net/Yexiaofen/article/details/78018204 */public class QuickSort { public static void main(String[] args) { int[] a ...
2019-07-29 19:31:22
171
转载 归并排序
package leetcode.sort;import java.util.Arrays;public class MergeSort { public static void merge(int[] a, int low, int mid, int high) { //1、high-low+1 就是本次要合并的两个数组的长度之和，low代表左边的有序数组在a中...
2019-07-29 19:13:22
71
转载 leetcode34 search for a range
[ds@client-ds-26-242-86 mediam]$ cat no34_FindFirstandLastPositionofElementinSortedArray.cpp#include<iostream>#include<vector>using namespace std;class Solution{public: vector<in...
2019-07-28 23:15:34
105
转载 leetcode 155 Min Stack
package leetcode.simple;import java.util.ArrayList;import java.util.List;/*push(x) -- 将元素 x 推入栈中。pop() -- 删除栈顶的元素。top() -- 获取栈顶元素。getMin() -- 检索栈中的最小元素。 */class MinStack { List<Integ...
2019-07-28 21:16:05
68
转载 leetcode 8 String to Integer (atoi)
#include<iostream>#include<string>#define INT_MAX 2147483647#define INT_MIN (-INT_MAX - 1)using namespace std;class Solution {public: int myAtoi(string str) { //str = trim(s...
2019-07-28 20:46:11
72
转载 堆排序
package leetcode.sort;import java.util.Arrays;/*整体思路是这样的：1、建堆的时候是从第一个非叶子节点开始的，这个叶子节点会在adjustHeap for循环中只走一次就结束但是其他的非叶子节点不一定只循环一次，比如会建堆的时候会遍历到根节点，这个节点在for循环中会循环多次也就是会从根节点开始一直交换到叶子节点为止2、在调整堆结构的时...
2019-07-28 18:19:54
149
转载 leetcode 3 Longest Substring Without Repeating Characters
#include<string>#include<iostream>//using std::string;using namespace std;class Solution {public:int lengthOfLongestSubstring(string s) { // 暴力搜索改良版，O（N^2） int index = 0; /...
2019-07-28 18:00:32
53
转载 leetcode 20 Valid Parentheses
#include<iostream>#include<stack>#include<string>using namespace std;class Solution {public: bool isValid(string s) { stack<char> sta; if(s[0] == '(' ||...
2019-07-28 17:57:35
121
转载 leetcode 22 Generate Parentheses
#include<iostream>#include<string>#include<vector>using namespace std;class Solution {public: vector<string> generateParenthesis(int n) { int left = n; int righ...
2019-07-28 17:55:00
59
转载 leetcode 26 Remove Duplicates from Sorted Array
#include<iostream>#include<vector>using namespace std;class Solution{public: int removeDuplicates(vector<int> &nums){ int size = nums.size(); int index = 0; for(in...
2019-07-28 17:28:46
84
转载 leetcode 82 Remove Duplicates from Sorted List II
#include<iostream>using namespace std;struct ListNode{ int value; ListNode *next; ListNode(int x):value(x),next(NULL){}};//https://blog.csdn.net/linhuanmars/article/details/24389429//h...
2019-07-28 17:26:32
58
转载 leetcode 80. Remove Duplicates from Sorted Array II
#include<iostream>#include<vector>using namespace std;class Solution {public: int removeDuplicates(vector<int>& nums) { if(nums.empty()){ return 0; } int index...
2019-07-28 17:23:29
158
转载 no92 Reverse Linked List II
#include<iostream>using namespace std;struct ListNode{ int val; ListNode *next; ListNode(int x): val(x),next(NULL){}}class solution{public: ListNode* reverseBetween(ListNode *head,int...
2019-07-28 17:12:37
69
转载 no206 Reverse Linked List
#include<iostream>using namespace std;struct ListNode{ int val; ListNode *next; ListNode(int x):val(x),next(NULL){}};//https://leetcode-cn.com/problems/reverse-linked-list/solution/die-...
2019-07-28 17:10:03
80
转载 leetcode 14 Longest Common Prefix
#include<iostream>#include<string>#include<vector>using namespace std;class Solution {public: string longestCommonPrefix(vector<string>& strs) { int size = str...
2019-07-28 16:38:22
68
转载 leetcode 28 Implement strStr()
#include<iostream>#include<string>using namespace std;class Solution{public: int implementStr(string haystack,string needle){ if(haystack.empty()|| needle.empty()){ return -1; ...
2019-07-28 15:17:23
86
转载 leetcode no43 Multiply Strings
package leetcode.simple;public class no43_MultiplyStrings {public static String multiply(String num1, String num2) {if (num1 == null || num2 == null || num1.length() == 0 || num2.length() == 0) {r...
2019-07-28 10:17:11
96
转载 leetcode96 Unique Binary Search Trees
leetcode96 Unique Binary Search Trees原题链接：https://leetcode-cn.com/problems/unique-binary-search-trees/参考链接：http://www.cnblogs.com/springfor/p/3884009.htmlhttp://blog.csdn.net/linhuanmars/article/...
2018-12-31 15:21:42
195
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人