- 博客(19)
- 收藏
- 关注
RSS订阅原创 145. Binary Tree Postorder Traversal
/** * Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * };
2017-07-12 07:34:24
134
原创 410. Split Array Largest Sum
class Solution { public: bool canSplit(vector& nums, int m, long long sum) { int c = 1; long long s = 0; for (auto& num : nums) { s += num;
2017-07-12 07:31:58
137
原创 517. Super Washing Machines
class Solution { public: int findMinMoves(vector& machines) { int totalDresses = 0, size = machines.size(); for (auto i = 0; i if (totalDresses % size != 0) return -1; auto
2017-07-12 07:30:19
190
原创 课本p287页
题目： 在精确的4SAT（EXACT 4SAT）问题中，输入为一组子句，每个子句都是恰好4个文字的析取，且每个变量最多在每个子句中出现一次。目标是求它的满足赋值（如果该赋值存在）。证明精确的4SAT问题是NP-完全问题。 证明：通过将3SAT规约到EXACT 4SAT来证明后者的NP完全性。对于任意一个3SAT实例来说，如果其中某个子句中包含了同一个文字多次，那么可以缩减为一次，如
2017-07-12 07:24:58
227
原创 347. Top K Frequent Elements
class Solution { public: vector topKFrequent(vector& nums, int k) { unordered_map map; for(int num : nums){ map[num]++; }
2017-06-28 19:56:14
130
原创 101. Symmetric Tree
class Solution { public: bool isSymmetric(TreeNode* root) { if(!root) return true; return ismirror(root->left, root->right); } bool ismirror(TreeNode* left, TreeNode*
2017-06-28 19:53:56
123
原创 241. Different Ways to Add Parentheses
class Solution { public: vector diffWaysToCompute(string input) { vector result; int size = input.size(); for (int i = 0; i char cur = input[i];
2017-06-28 19:41:41
136
原创 215. Kth Largest Element in an Array
arrangeRight(nums,0,nums.size()-1,k); quickSort(nums,nums.size()-k,nums.size()-1); return nums[nums.size()-k]; } void arrangeRight(vector& nums, int start, int end
2017-06-28 19:39:36
121
原创 97. Interleaving String
class Solution { public: bool isInterleave(string s1, string s2, string s3) { int n1=s1.size(),n2=s2.size(),n3=s3.size(); if(n1+n2!=n3) return false; vector mp(255,0);
2017-06-15 11:15:45
123
原创 134. Gas Station
class Solution { public: int canCompleteCircuit(vector& gas, vector& cost) { for(int i = 0; i gas[i] -= cost[i]; } int sum = 0; int result = 0; int n
2017-06-15 09:50:20
121
原创 394. Decode String
class Solution { public: string decodeString(string s) { stack chars; stack nums; string res; int num = 0; for(char c : s) { if(isdigit(c)) {
2017-06-15 09:08:25
151
原创 315. Count of Smaller Numbers After Self
class Solution { public: vector countSmaller(vector& nums) { vector counts(nums.size()); for(int i=0; i int num=0; for(int j=i+1; j
2017-06-15 08:55:46
205
原创 343. Integer Break
class Solution { public: int integerBreak(int n) { if(n int res = 1; while(n > 2){ res *= 3; n -= 3; } if(n
2017-06-15 08:47:20
126
原创 67. Add Binary
class Solution { public: string addBinary(string a, string b) { string sum = ""; int i = a.length() - 1; int j = b.length() - 1; int c = 0; wh
2017-04-09 21:32:25
156
原创 442. Find All Duplicates in an Array
class Solution { public: vector findDuplicates(vector& nums) { int leng = nums.size(); map twice; vector ret; for(int i = 0; i map::
2017-03-26 21:32:24
181
原创 394. Decode String
string decodeString(string s) { stack chars; stack nums; string res; int num = 0; for(char c : s) { if(isdigit(c)) {
2017-03-26 21:30:48
131
原创 268. Missing Number
class Solution { public: int missingNumber(vector& nums) { int sum1 = 0; for(int i = 0; i sum1 = sum1 + i; } int sum2 = 0; for(int i = 0; i sum2 = sum2 + nums[i]; }
2017-03-12 18:27:01
128
原创 169. Majority Element
class Solution { public: int majorityElement(vector& nums) { int major=nums[0], count = 1; for(int i=1; i if(count==0){ count++;
2017-03-05 21:42:56
129
原创 485. Max Consecutive Ones
class Solution { public: int findMaxConsecutiveOnes(vector& nums) { int a=0,b=0; for(int i=0;i { if((nums[i]==1)&&(i!=nums.size()-1)) a++; if(nums[i]==0){ i
2017-02-28 19:47:16
168
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人