leetcode
关注
分享
扫一扫
「已注销」
这个作者很懒，什么都没留下…
展开
-
Leetcode 1018. Binary Prefix Divisible By 5
#include<math.h>class Solution {public: vector<bool> prefixesDivBy5(vector<int>& A) { int l = A.size(); vector<bool> res(l); int rem...原创 2019-07-08 22:57:41 · 315 阅读 · 0 评论 -
leetcode 671. Second Minimum Node In a Binary Tree
/** * Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; */cla...原创 2019-04-12 16:44:26 · 145 阅读 · 0 评论 -
leetcode 566. Reshape the Matrix
class Solution {public: vector<vector<int>> matrixReshape(vector<vector<int>>& nums, int r, int c) { vector<vector<int>> res(r); int m=num...原创 2019-04-12 16:09:13 · 116 阅读 · 0 评论 -
leetcode 461. Hamming Distance
class Solution {public: int hammingDistance(int x, int y) { int count = 0; while(x&&y) { int r1 = x%2; int r2 = y%2; if(r1!=r2...原创 2019-04-12 15:40:05 · 113 阅读 · 0 评论 -
leetcode 896. Monotonic Array
class Solution {public: bool isMonotonic(vector<int>& A) { bool increase=false; if(A.size()==0||A.size()==1)return true; int i; for(i=0;i<A....原创 2019-04-12 15:29:33 · 150 阅读 · 0 评论 -
leetcode 806. Number of Lines To Write String
class Solution {public: vector<int> numberOfLines(vector<int>& widths, string S) { vector<int> last; last.push_back(0); last.push_back(0); i...原创 2019-04-09 09:19:26 · 84 阅读 · 0 评论 -
leetcode 559. Maximum Depth of N-ary Tree
/*// Definition for a Node.class Node {public: int val; vector<Node*> children; Node() {} Node(int _val, vector<Node*> _children) { val = _val; childr...原创 2019-04-09 08:55:04 · 92 阅读 · 0 评论 -
leetcode 617. Merge Two Binary Trees
/** * Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; */cla...原创 2019-04-08 22:28:11 · 138 阅读 · 0 评论 -
leetcode 617. Merge Two Binary Trees
class Solution {public: int numJewelsInStones(string J, string S) { int count = 0; for(int i=0;i<J.length();i++) { for(int k = 0;k<S.length();k++) ...原创 2019-04-08 22:24:25 · 116 阅读 · 0 评论 -
leetcode 443. String Compression
#include<stack>class Solution {public: int compress(vector<char>& chars) { char tmp=chars[0]; int count =1; int sum = 0; int j=0; for(int...原创 2019-04-08 22:11:14 · 124 阅读 · 0 评论 -
leetcode 965. Univalued Binary Tree
/** * Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; */cla...原创 2019-04-08 21:33:38 · 93 阅读 · 0 评论 -
leetcode 985. Sum of Even Numbers After Queries
class Solution {public: vector<int> sumEvenAfterQueries(vector<int>& A, vector<vector<int>>& queries) { int l1 = A.size(); int l2 = queries.size()...原创 2019-04-08 20:58:53 · 124 阅读 · 0 评论 -
leetcode 832. Flipping an Image
class Solution {public: vector<vector<int>> flipAndInvertImage(vector<vector<int>>& A) { int m = A.size(); int n = A[0].size(); // cout<<...原创 2019-04-08 15:08:02 · 116 阅读 · 0 评论 -
leetcode 897. Increasing Order Search Tree
/** * Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; */cla...原创 2019-04-08 14:59:45 · 136 阅读 · 0 评论 -
leetcode 415. Add Strings
class Solution {public: string addStrings(string num1, string num2) { int l1 = num1.length(); int l2 = num2.length(); string s; int c=0,i=l1-1,j=l2-1,count=0;; ...原创 2019-04-16 09:08:36 · 177 阅读 · 0 评论 -
leetcode 944. Delete Columns to Make Sorted
class Solution {public: int minDeletionSize(vector<string>& A) { int l = A.size(); int s = A[0].length(); int count =s; for(int i=0;i<s;i++)...原创 2019-04-12 20:33:06 · 155 阅读 · 0 评论 -
leetcode 606. Construct String from Binary Tree
/** * Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; */cla...原创 2019-04-12 21:13:39 · 134 阅读 · 0 评论 -
leetcode 914. X of a Kind in a Deck of Cards
#include<algorithm>#include<map>class Solution {public: bool hasGroupsSizeX(vector<int>& deck) { int l = deck.size(); if(l<2)return false; map...原创 2019-04-14 22:43:09 · 206 阅读 · 0 评论 -
leetcode 561. Array Partition I
class Solution {public: bool isOneBitCharacter(vector<int>& bits) { int l = bits.size(); int i=0; while(i<l-1) { if(bits[i]==1) ...原创 2019-04-14 21:47:55 · 170 阅读 · 0 评论 -
leetcode 796. Rotate String
class Solution {public: bool rotateString(string A, string B) { int l1 = A.length(); int l2 = B.length(); if(l1!=l2)return false; if(l1==0)return true; ...原创 2019-04-14 21:33:46 · 144 阅读 · 0 评论 -
leetcode 917. Reverse Only Letters
class Solution {public: bool isString(char s) { if((s<='z'&&s>='a')||(s<='Z'&&s>='A')) return true; else return false; } strin...原创 2019-04-14 21:12:09 · 212 阅读 · 0 评论 -
leetcode 557. Reverse Words in a String III
#include<stack>class Solution {public: string reverseWords(string s) { int l = s.length(); int i = 0; string res; stack<char> tmp; w...原创 2019-04-13 15:51:51 · 2310 阅读 · 0 评论 -
leetcode 500. Keyboard Row
class Solution {public: vector<string> findWords(vector<string>& words) { int alpha[26] ={1,2,2,1,0,1,1,1,0,1,1,1,2,2,0,0,0,0,1,0,0,2,0,2,0,2}; vector<string&g...原创 2019-04-10 10:01:28 · 150 阅读 · 0 评论 -
leetcode 509. Fibonacci Number
class Solution {public: int fib(int N) { if(N==0)return 0; if(N==1)return 1; int first=0,second=1; for(int i=2;i<=N;i++) { int tmp = first+...原创 2019-04-10 09:52:16 · 206 阅读 · 0 评论 -
leetcode 590. N-ary Tree Postorder Traversal
/*// Definition for a Node.class Node {public: int val; vector<Node*> children; Node() {} Node(int _val, vector<Node*> _children) { val = _val; childr...原创 2019-04-09 21:53:58 · 175 阅读 · 0 评论 -
leetcode 762. Prime Number of Set Bits in Binary Representation
#include<cmath>class Solution {public: bool isPrime(int l) { if(l==0||l==1)return false; if(l==2||l==3)return true; for(int i=2;i<=sqrt(l);i++) { ...原创 2019-04-13 13:55:16 · 134 阅读 · 0 评论 -
leetcode 830. Positions of Large Groups
class Solution {public: vector<vector<int>> largeGroupPositions(string S) { int l = S.length(); vector<vector<int>> t; int i=0; w...原创 2019-04-12 22:44:22 · 123 阅读 · 0 评论 -
leetcode 1013. Partition Array Into Three Parts With Equal Sum
class Solution {public: bool canThreePartsEqualSum(vector<int>& A) { int l = A.size(); int sum=0; int i; for(i=0;i<l;i++) sum+=A[i]; ...原创 2019-04-12 22:32:19 · 252 阅读 · 0 评论 -
leetcode 700. Search in a Binary Search Tree
/** * Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; */cla...原创 2019-04-12 22:05:52 · 222 阅读 · 0 评论 -
leetcode 852. Peak Index in a Mountain Array
class Solution {public: int peakIndexInMountainArray(vector<int>& A) { int l =A.size(); int i=0,j=l-1; for(i;i<l-1;i++) { if(A[i]<A[i+...原创 2019-04-12 21:46:19 · 156 阅读 · 0 评论 -
leetcode 202. Happy Number
#include<set>class Solution {public: bool isHappy(int n) { set<int> visited; visited.insert(n); int sum = n; while(sum!=1) { n = ...原创 2019-03-29 09:11:48 · 89 阅读 · 0 评论 -
leetcode 367. Valid Perfect Square
class Solution {public: bool isPerfectSquare(int num) { int i = 1; while(num>0) { num = num -i; i = i + 2; } if(num==0...原创 2019-04-07 15:58:18 · 80 阅读 · 0 评论 -
leetcode 237. Delete Node in a Linked List
class Solution {public: void deleteNode(ListNode* node) { if(node==NULL||node->next==NULL) return ; ListNode* tmp; tmp = node->next; node->va...原创 2019-03-31 17:24:13 · 89 阅读 · 0 评论 -
leetcode 155 Min Stack
#include<stack>#include<limit.h>class MinStack {public: stack<int> stack1; /** initialize your data structure here. */ MinStack() { } void push(int x...原创 2019-03-27 10:10:55 · 113 阅读 · 0 评论 -
leetcode 141. Linked List Cycle
思路:利用set中不会包含重复元素的特点，遍历List，每次将遍历的节点存入set，一旦发现该节点已经在set中，则表示有回路。#include<set>class Solution {public: bool hasCycle(ListNode *head) { ListNode *tmp = head,*p; se...原创 2019-03-27 10:01:32 · 80 阅读 · 0 评论 -
leetcode 125 valid-palindrome
思路：分别从左low和右high开始比较，如果两个位置的char是数字或者字母，则比较是否相同，如果有一方不是数字或者字符就向中间走，直到是字符或数字时，如果比较后发现不同，跳出循环，直接返回false，否则继续执行，直到low和high相遇，此时表示字符串是回文，返回true。#include<string>class Solution {public: bool ...原创 2019-03-27 09:41:20 · 92 阅读 · 0 评论 -
leetcode 257. Binary Tree Paths
/** * Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; */cla...原创 2019-03-30 22:28:58 · 118 阅读 · 0 评论 -
leetcode 404. Sum of Left Leaves
/** * Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; */cla...原创 2019-03-30 22:08:14 · 94 阅读 · 0 评论 -
leetcode 429. N-ary Tree Level Order Traversal
#include<queue>/*// Definition for a Node.class Node {public: int val; vector<Node*> children; Node() {} Node(int _val, vector<Node*> _children) { val ...原创 2019-03-30 15:50:52 · 114 阅读 · 0 评论 -
leetcode 234. Palindrome Linked List
/** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * ListNode(int x) : val(x), next(NULL) {} * }; */class Solution {public: bool isPali...原创 2019-03-30 11:32:37 · 95 阅读 · 0 评论