zem_nezer的博客

cannot solve it. use the property of BST and preorder, which is the first element is the root of the tree, we can break it into 2 part, and the upper bound of left part is root, so as the lower bound ...

cannot solve it. Simply use BFS, and use status compress to compress the tiles into a string, and use set to record it.

error: cannot solve it. pattern: check edge case: if up == INT_MIN, return INT_MAX if down == -1, INT_MIN if down == 1; convert up and down to positive integer every time use a variable to remember h...

O(nlogk), use priority_queue to do this, create a max heap if(heap.size() < K or heap.top() > cur_dis), then update new data.

error: do not know what is move means, use row array, col array, diag, anti_diag to record current situation. Assign 1 if player is 1, and -1 if player is 2

error: cannot solve it. pattern: dp[i][j] = dp[i - 1][j - 1] + 1 (if s[i - 1] == p[j - 1]) dp[i][j] = max(dp[i - 1][j], dp[i][j - 1]) (if s[i - 1] != p[j - 1]) now cannot explain why dp[i][j] = dp[i ...

error: cannot solve it. pattern: dfs(x, y) = max(1 + dfs(new_x, new_y)), where val[x][y] < val[new_x][new_y]. if(dp[x][y] != -1) return dp[x][y];

error: cannot solve it. it is about two part of array, not two point, every time compare rightmost of left part and leftmost of right part, i.e. nums[mid] and nums[mid + 1]. If nums[mid] < nums[mid...

error: cannot solve it. assume T[i, j] = k, where T[i, j] is the sum of nums[i] to nums[j]. So the equations can transform to: S[j] - S[i - 1] = k. And if we know that preious the occurs of S[j] - k, ...

error: cannot solve it. use a previous node to store last inorder variable, then perform inroder traverse. pattern: inorder(root->left); prev->left = root; root->right = prev; ...

error: cannot solve it. pattern: left open, right close for current search range convert(head, tail): if(head == tail) return nullptr; mid = find(head, tail); TreeNode *tree_mid = new TreeNo...

error: cannot slove it. recursive call flatten(root->left), flatten(root->right) get the rightmost of root->left append root->right to rightmost of root->left assign root->left = nu...

assume for each coordinate: {x1, y1}: lower left, {x2, y2}: upper right inter_x1 = max(x1, x1) inter_y1 = max(y1, y1) inter_x2 = min(x2, x2) inter_y2 = min(y2, y2) then we can calculate the intersecti...

error: cannot slove it. Use two heap, first the keep store left half and other for right heap. And 0 <= |left.size() - right| <= 1. If violent the rule, move to top number to other side. If cu...

error: use dp equation: dp[i][j]: whether string s of first i characters is match with string p of first j characters initial: dp[0][0] = true; dp[0][j] = dp[0][j - 1] (if p[j - 1] == '*') transfo...

error: do not want to coding ANYMORE!!! compute the matrix from (0, 0) to (x, y), then get the matrix sums[][]. for each point (x, y), compute its possible square, i.e., square from (x, y) to (x + di...

error: use equation: dp[i][j] = min(max(sums[i] - sums[k], dp[k][j - 1])), where dp[i][j] means the min. number divide 0-i into j group. if(j == 1) -> dp[i][j] = sums[i]; if(i < j) -> no solu...

error: use DP. In i-th day, we can buy or sell, so we have two status: buy[i] or sell[i]. Each stands for the max profit if we buy/sell. So: sell[i] = max(sell[i - 1], sell[i - 1] + prices[i] + fee) b...

error: cannot solve it. DP equation: dp[i] = sum(num + dp[i - num]), where num is a number of nums vector, dp[i] is the total solution of sum to i. Also, initial dp[0] = 1 So that we can use memorize ...

Error: need to use hashtable + vector. Hashtable to check whether a element is in vector or not. And store the index of vector, i.e., key: val in vector, val: index in vector Vector is use to insert/d...