Peinan Weng

永不放弃 直到做对为止

LeetCode - Sliding Window Typical Problems - N/A

Posted by Peinan on November 13, 2019

LeetCode - Multiset and Sliding Window - Advanced STL Using

Problem Here Solution 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 class Solution { public: vector<double> medianSlidingWindow(vector<int>& nums, int k) { ...

Posted by Peinan on November 13, 2019

LeetCode - Using Hash Map as Memory - N/A

Posted by Peinan on November 12, 2019

LeetCode - Subarray Problems - N/A

Posted by Peinan on November 12, 2019

LeetCode - Stock Problems - N/A

Posted by Peinan on November 12, 2019

LeetCode - Water and Jug Problem - N/A

Problem

Posted by Peinan on November 9, 2019

LeetCode - Dynamic Programming - Rerangement of Array - N/A

Problem

Posted by Peinan on November 9, 2019

LeetCode - Don't always let your mind constrained by input scale

Problem Actually this problem is not so hard if you consider a 2-dimensional dynamic programming method. For the memory structure and the induction is easy to derive. 1 dp[i][j] = (dp[i - 4][j] +...

Posted by Peinan on November 7, 2019

LeetCode - 800 MARK

Posted by Peinan on November 7, 2019

Combinatorial Optimization - Hungarian Algorithm - N/A

Problem 1 (Need Premium) Solution1 - Using Dynamic Programming O(n^2 4^n) Time Complexity Solution1 - Using Hungarian Algorithm O(n^3) Time Complexity 1

Posted by Peinan on November 5, 2019