Batman_的博客

290 WordPatternclass Solution {public: bool wordPattern(string pattern, string str) { bool flag[30]={0}; vector word; word.clear(); word.resize(30); int

423 Reconstruct Original Digits from Englishclass Solution{public: void makeSch(vector > &sch) { sch.push_back(make_pair('g'-'a',8)); sch.push_back(make_pair('u'-'a',4));

424 Longest Repeating Character Replacementclass Solution {public: int characterReplacement(string s, int k) { int ans=0; int ls=s.size(); vector letters; in

380 Insert Delete GetRandom O(1)class RandomizedSet {public: /** Initialize your data structure here. */ RandomizedSet() { s.clear(); } /** Inserts a value to the set.

45 Jump Game IIclass Solution {public: int jump(vector& nums) { int len=nums.size(); if (len==1) return 0; int ans=0,maxPos=0,lastmax=0; for(int i=0;i<len-1;

123 Best Time to Buy and Sell Stock IIIclass Solution {public: int maxProfit(vector& prices) { int len=prices.size(); if (len<2) return 0; int release2=0,hold2=INT_M

310 Minimum Height Treesclass Solution{public: vector findMinHeightTrees(int n, vector >& edges) { vector > grid; int len=edges.size(); grid.clear(); grid.r

332 Reconstruct Itineraryclass Solution {public: bool sign; vector ans; vector anstmp; int n; int ntickets; vector >used; vector > road; map relation; map itosre

5 Longest Palindromic Substringclass Solution{public: string str; int len; string longestPalindrome(string s) { str = s; len = s.size()-1; return force();

406 Queue Reconstruction by Heightclass Solution {public: vector > reconstructQueue(vector >& people) { int len=people.size(); vector > ans; ans.clear(); sor

392 Is Subsequenceclass Solution {public: bool isSubsequence(string s, string t) { int ls = s.length(), lt= t.length(); if (ls==0) return true; int ps=0; boo

8 String to Integer (atoi)class Solution {public: int myAtoi(string str) { int ans=0,len=str.length(),flag=1; if (len==0) return ans; int st=0; bool cntflag=

282 Expression Add Operatorsclass Solution {public: vector ans; long long int strtoNum(string str) { long long int p=1; if (str[0]=='-') { p=-1;

313 Super Ugly Numberclass Solution {public: int nthSuperUglyNumber(int n, vector& primes) { vector cnt(primes.size(),0); vector result(n,0); result[0]=1; fo

345 Reverse Vowels of a Stringclass Solution {public: string reverseVowels(string s) { int len=s.length(); if (len==0) return ""; int flag[300]={0}; flag['

338 Counting Bitsclass Solution {public: vector countBits(int num) { vector ans; ans.clear(); ans.resize(num+1); ans[0]=0; int p; if (num<=0)

213 House Robber IIclass Solution {public: int rob(vector& nums) { int len=nums.size(); if (len==0) return 0; if (len==1) return nums[0]; vectorf; f.

47 Permutations IIclass Solution {public: vector > permuteUnique(vector& nums) { sort(nums.begin(),nums.end()); vector > ans; ans.push_back(nums); while (nex

167 Two Sum II - Input array is sortedclass Solution {public: vector twoSum(vector& numbers, int target) { vector ans; ans.clear(); int len=numbers.size(); i

349 Intersection of Two Arraysclass Solution {public: vector intersection(vector& nums1, vector& nums2) { settmpans; vector ans; int ln1=nums1.size(),ln2=nums2.size(

400 Nth Digitclass Solution {public: vector f; vector g; vector tens; int dUpper = 10; int th = 9; void countNumbers() { long long ten = 1; long long nin

327 Count of Range Sum// See the discuss// See the analysis and using the code from:// http://www.cnblogs.com/jdneo/p/5388501.html// It is a solution combining the two pointers & merge sort// Th

139 Word Break// Thought:// After several fails, I finally made it!// Core thought: convert the dic words according to the string s to vector of intervals// then, sort the intervals, and mark

============================ Dynamic Programming ===============================斐波那契f[i]:第i个的值70. Climbing Stairs（1或2步爬楼梯）f[i]=f[i-1]+f[i-2];91. Decode Ways（编码方式的个数）int tmp=((s[i-1]-'0

========================================== Graph =========================================------------------------------------ Topological Sort ------------------------------------207. Course

============================= Hash Table =============================36. Valid Sudoku（判断一个表格是不是数独）S1(Mine): 每行每列分别计数即可49. Group Anagrams（使用相同字母的单词分在同一组）S1(Mine): 每个单词排序，排好序后相同的字符串，用map记录在an

============================== Linked List ============================复制138. Copy List with Random Pointer（复制一个乱七八糟的链表）S1(Mine): 用递归，指向什么，就新生成一个node，让这个node等于递归当前点指向的东西         用hash记录节点地

============================ Math ====================================343. Integer Break（给定一个数n，拆成乘积最大的一堆数）要三不要二 要二不要一约数倍数365. Water and Jug Problem（容器量出指定水）Discuss: 转换成了GCD400.

=========================== Search ===================================------------------------------ Backtracking  ----------------------------------------找到所有子集39. Combination Sum 40. Combi

============================ Sort =================================------------------------- Merge Sort --------------------------88. Merge Sorted Array（合并2个有序数组）：朴素315. Count of Smaller

--------------------------------- map/set/vector -----------------------------------------380. Insert Delete GetRandom O(1)（设计一个数据结构，可以插入、删除、随机返回元素）381. Insert Delete GetRandom O(1) - Duplicates a

=========================================== Array ========================================中位数4. Median of Two Sorted Arrays（两有序数列，求他们的中位数，O(log (m+n)).）S1：最朴素，两个数列归并排序，选取中间位置。S2：two pointe

132 Palindrome Partitioning II// ----------------Seeing Discuss-----------/* copying codes url https://discuss.leetcode.com/topic/2840/my-solution-does-not-need-a-table-for-palindrome-is-it-rig

37 Sudoku Solver// ----------------Seeing Discuss-----------/* copying codes url https://discuss.leetcode.com/topic/5002/a-simple-dfs-solution Analysis: */class Solution {public: bool is

307 Range Sum Query - Mutable// Segment Tree with build, update, query// Pay attention to the size of segTree[], may cause REclass NumArray{public: NumArray(vector &nums) { num=n

134 Gas Station// ----------Seeing Discuss---------------// Here is the Analysis from the Discuss// """ 1. If car starts at A and can not reach B. Any station between A and B// can not reach B.

373 Find K Pairs with Smallest Sumsclass Solution {public: struct Node { int sum,i,j; Node(int s,int x,int y):sum(s),i(x),j(y){}; }; vector sums; static bool cmp

391 Perfect Rectangle// -------------------Seeing Discuss & Searching the Solutions// Analysis:/* 任意一个矩形均有4个顶点，当出现Perfect Rectangle时，在最大覆盖矩形内部， 所有其它矩形的任意一个顶点均会出现偶数次（因为一个矩形旁边应当有一个或三个矩形 和它紧密相连，那么

295 Find Median from Data Stream// I thought maybe can use two heaps, one is min heap, one is max heap. // keep the balance of the two heaps, the size equall, or min is 1 greater than max// min-he

385 Mini Parser// -------------------- Seeing Discuss -----------// I really have no idea about this kind of problem// I just retyped the codes from discuss// url:// https://discuss.leetcode.co