water flow days – Moonstone


water flow days – Moonstone
题目就是给你一个matrix,里面的数字代表bar的高度,现在说降雨量如果高于bar的高度水可以漫过去,降雨量0开始每天+1这样,问最早第几天水可以有一条路径从src漫到dst

这轮也是讨论optimization很久,最后用bfs写一个subproblem。

http://www.1point3acres.com/bbs/thread-191771-1-1.html

第三题是不是就是lc 174. Dungeon Game的变种?DP从dst开始做?

这道题常规解法是O(max(day)*n^2) 当mat里有个别bar相当高的时候那么day by day增长的模式会造成大量空转 所以一个办法来避免是先把所有bar寻到一个数组并排好序 然后每当bfs到某几个bar不能再move的时候 我们从那个数组里找到某天天数大于当前bound某个bar 然后继续bfs到不能再走 这样一直到找到终点 这样总能最早到达目的地因为每次bfs完我们都是从那个数组里找到下一个最早能继续move的时间。

不是给了src和destination吗?楼主的意思是如果bfs到某个点走不动了,直接跳到下一个点继续bfs吗?这样可以吗?
我的想法是贪心+BFS,一旦有路就走到下面去,没有就选四个里面最小的那个走下去
是的 就是从那个排好序的数字搜索下一个直接跳 其实找下一个的这个时间复杂度我感觉是降不下来的 好像面试官也这么认为..

先假设这个问题是一维的,那么从src能够淹没到dst的日期取决于他俩之间最高的bar的高度。
转换为一个matrix的话,我们其实就是要找一条从src到dst的路径,这条路径上最高bar的高度越小越好。然后最短日期其实就是这条路径上最高bar的高度+1。

我们可以用BFS,然后把一般BFS其中的queue换成priority queue,在priority queue顶端的是当前未走过的高度最小的bar的index。
int leastDays(const pair<int, int>& src, const pair<int, int>& dst, const vector<vector<int>>& matrix) const {
        const vector<pair<int, int>> directions{ { 0, 1 }, { 0, -1 }, { 1, 0 }, { -1, 0 } };
        int n = matrix.size();
        if (n == 0) {
                return 0;
        }
        int m = matrix.size();
        if (m == 0) {
                return 0;
        }
        int highest = 0;
        auto comp = [&](const node& rhs, const node& lhs){ return rhs.value != lhs.value ? rhs.value > lhs.value : rhs.index > lhs.index; };
        unordered_set<pair<int, int>, MyHash> visited;
        priority_queue<node, vector<node>, decltype(comp)> q;

        visited.insert(src);
        q.emplace(src, matrix[src.first][src.second]);
        while (!q.empty()) {
                auto p = q.top();
                q.pop();
                if (p.value > highest) {
                        highest = p.value;
                }
                for (const auto& d : directions) {
                        pair<int, int> next(p.index.first + d.first, p.index.second + d.second);
                        if (next.first >= 0 && next.first < n && next.second >= 0 && next.second < m && visited.find(next) == visited.end()) {
                                if (next == dst) {
                                        highest = max(highest, matrix[dst.first][dst.second]);
                                        return highest + 1;
                                }
                                int next_value = matrix[next.first][next.second];
                                q.emplace(next, next_value);
                                visited.insert(next);
                        }
                }
        }
        return highest + 1;
}

struct MyHash {
        inline std::size_t operator()(const std::pair<int, int>& p) const {
                return (hash<int>()(p.first) + hash<int>()(p.second));
        }
};

struct node {
        pair<int, int> index;
        int value;
        node(pair<int, int> idx, int val) : index(idx), value(val) {}
};
};


    public void TestMinDaysOfWaterFlow()
    {
        int[,] matrix1 = new int[,]
        {
            {5, 8, 15, 20},
            {13, 7, 3, 1},
            {9, 10, 8, 4}
        };
        int r1 = MinDaysOfWaterFlow(matrix1, 0, 0, 2, 3);
    }
    public int MinDaysOfWaterFlow(int[,] matrix, int startRow, int startColumn, int endRow, int endColumn)
    {
        int result = int.MaxValue;
        Stack<Tuple<int, int>> stack = new Stack<Tuple<int, int>>();
        HashSet<int> visited = new HashSet<int>();
        MinDaysOfWaterFlowHelper(matrix, ref result, ref matrix[startRow, startColumn], startRow, startColumn, endRow, endColumn, visited, stack);
        return result;
    }
    private void MinDaysOfWaterFlowHelper(int[,] matrix, ref int result, ref int curMax, int startRow, int startColumn, int endRow, int endColumn, HashSet<int> visited, Stack<Tuple<int, int>> stack)
    {
        int R = matrix.GetLength(0);
        int C = matrix.GetLength(1);
        if ((startRow == endRow) && (startColumn == endColumn))
        {
            if ((result == int.MaxValue) || (curMax < result))
            {
                result = curMax;
            }
            return;
        }
        int index = startRow * R + startColumn;
        visited.Add(index);
        int[] dirX = new int[4] { 0, -1, 0, 1 };
        int[] dirY = new int[4] { -1, 0, 1, 0 };
        for (int i = 0; i < 4; i++)
        {
            int x = startRow + dirX[i];
            int y = startColumn + dirY[i];
            if ((x >= 0) && (x < R) && (y >= 0) && (y < C) && (!visited.Contains(x * R + y)))
            {
                if ((result != int.MaxValue) && (matrix[x, y] >= result))
                {
                    continue;
                }
                int preCurMax = curMax;
                if (matrix[x, y] >= curMax)
                {
                    curMax = matrix[x, y];
                }
                stack.Push(new Tuple<int, int>(x, y));
                MinDaysOfWaterFlowHelper(matrix, ref result, ref curMax, x, y, endRow, endColumn, visited, stack);
                stack.Pop();
                if (matrix[x, y] == curMax)
                {
                    curMax = preCurMax;
                }
            }
        }
        visited.Remove(index);
    }
}
Read full article from water flow days – Moonstone

Labels

LeetCode (1432) GeeksforGeeks (1122) LeetCode - Review (1067) Review (882) Algorithm (668) to-do (609) Classic Algorithm (270) Google Interview (237) Classic Interview (222) Dynamic Programming (220) DP (186) Bit Algorithms (145) POJ (141) Math (137) Tree (132) LeetCode - Phone (129) EPI (122) Cracking Coding Interview (119) DFS (115) Difficult Algorithm (115) Lintcode (115) Different Solutions (110) Smart Algorithm (104) Binary Search (96) BFS (91) HackerRank (90) Binary Tree (86) Hard (79) Two Pointers (78) Stack (76) Company-Facebook (75) BST (72) Graph Algorithm (72) Time Complexity (69) Greedy Algorithm (68) Interval (63) Company - Google (62) Geometry Algorithm (61) Interview Corner (61) LeetCode - Extended (61) Union-Find (60) Trie (58) Advanced Data Structure (56) List (56) Priority Queue (53) Codility (52) ComProGuide (50) LeetCode Hard (50) Matrix (50) Bisection (48) Segment Tree (48) Sliding Window (48) USACO (46) Space Optimization (45) Company-Airbnb (41) Greedy (41) Mathematical Algorithm (41) Tree - Post-Order (41) ACM-ICPC (40) Algorithm Interview (40) Data Structure Design (40) Graph (40) Backtracking (39) Data Structure (39) Jobdu (39) Random (39) Codeforces (38) Knapsack (38) LeetCode - DP (38) Recursive Algorithm (38) String Algorithm (38) TopCoder (38) Sort (37) Introduction to Algorithms (36) Pre-Sort (36) Beauty of Programming (35) Must Known (34) Binary Search Tree (33) Follow Up (33) prismoskills (33) Palindrome (32) Permutation (31) Array (30) Google Code Jam (30) HDU (30) Array O(N) (29) Logic Thinking (29) Monotonic Stack (29) Puzzles (29) Code - Detail (27) Company-Zenefits (27) Microsoft 100 - July (27) Queue (27) Binary Indexed Trees (26) TreeMap (26) to-do-must (26) 1point3acres (25) GeeksQuiz (25) Merge Sort (25) Reverse Thinking (25) hihocoder (25) Company - LinkedIn (24) Hash (24) High Frequency (24) Summary (24) Divide and Conquer (23) Proof (23) Game Theory (22) Topological Sort (22) Lintcode - Review (21) Tree - Modification (21) Algorithm Game (20) CareerCup (20) Company - Twitter (20) DFS + Review (20) DP - Relation (20) Brain Teaser (19) DP - Tree (19) Left and Right Array (19) O(N) (19) Sweep Line (19) UVA (19) DP - Bit Masking (18) LeetCode - Thinking (18) KMP (17) LeetCode - TODO (17) Probabilities (17) Simulation (17) String Search (17) Codercareer (16) Company-Uber (16) Iterator (16) Number (16) O(1) Space (16) Shortest Path (16) itint5 (16) DFS+Cache (15) Dijkstra (15) Euclidean GCD (15) Heap (15) LeetCode - Hard (15) Majority (15) Number Theory (15) Rolling Hash (15) Tree Traversal (15) Brute Force (14) Bucket Sort (14) DP - Knapsack (14) DP - Probability (14) Difficult (14) Fast Power Algorithm (14) Pattern (14) Prefix Sum (14) TreeSet (14) Algorithm Videos (13) Amazon Interview (13) Basic Algorithm (13) Codechef (13) Combination (13) Computational Geometry (13) DP - Digit (13) LCA (13) LeetCode - DFS (13) Linked List (13) Long Increasing Sequence(LIS) (13) Math-Divisible (13) Reservoir Sampling (13) mitbbs (13) Algorithm - How To (12) Company - Microsoft (12) DP - Interval (12) DP - Multiple Relation (12) DP - Relation Optimization (12) LeetCode - Classic (12) Level Order Traversal (12) Prime (12) Pruning (12) Reconstruct Tree (12) Thinking (12) X Sum (12) AOJ (11) Bit Mask (11) Company-Snapchat (11) DP - Space Optimization (11) Dequeue (11) Graph DFS (11) MinMax (11) Miscs (11) Princeton (11) Quick Sort (11) Stack - Tree (11) 尺取法 (11) 挑战程序设计竞赛 (11) Coin Change (10) DFS+Backtracking (10) Facebook Hacker Cup (10) Fast Slow Pointers (10) HackerRank Easy (10) Interval Tree (10) Limited Range (10) Matrix - Traverse (10) Monotone Queue (10) SPOJ (10) Starting Point (10) States (10) Stock (10) Theory (10) Tutorialhorizon (10) Kadane - Extended (9) Mathblog (9) Max-Min Flow (9) Maze (9) Median (9) O(32N) (9) Quick Select (9) Stack Overflow (9) System Design (9) Tree - Conversion (9) Use XOR (9) Book Notes (8) Company-Amazon (8) DFS+BFS (8) DP - States (8) Expression (8) Longest Common Subsequence(LCS) (8) One Pass (8) Quadtrees (8) Traversal Once (8) Trie - Suffix (8) 穷竭搜索 (8) Algorithm Problem List (7) All Sub (7) Catalan Number (7) Cycle (7) DP - Cases (7) Facebook Interview (7) Fibonacci Numbers (7) Flood fill (7) Game Nim (7) Graph BFS (7) HackerRank Difficult (7) Hackerearth (7) Inversion (7) Kadane’s Algorithm (7) Manacher (7) Morris Traversal (7) Multiple Data Structures (7) Normalized Key (7) O(XN) (7) Radix Sort (7) Recursion (7) Sampling (7) Suffix Array (7) Tech-Queries (7) Tree - Serialization (7) Tree DP (7) Trie - Bit (7) 蓝桥杯 (7) Algorithm - Brain Teaser (6) BFS - Priority Queue (6) BFS - Unusual (6) Classic Data Structure Impl (6) DP - 2D (6) DP - Monotone Queue (6) DP - Unusual (6) DP-Space Optimization (6) Dutch Flag (6) How To (6) Interviewstreet (6) Knapsack - MultiplePack (6) Local MinMax (6) MST (6) Minimum Spanning Tree (6) Number - Reach (6) Parentheses (6) Pre-Sum (6) Probability (6) Programming Pearls (6) Rabin-Karp (6) Reverse (6) Scan from right (6) Schedule (6) Stream (6) Subset Sum (6) TSP (6) Xpost (6) n00tc0d3r (6) reddit (6) AI (5) Abbreviation (5) Anagram (5) Art Of Programming-July (5) Assumption (5) Bellman Ford (5) Big Data (5) Code - Solid (5) Code Kata (5) Codility-lessons (5) Coding (5) Company - WMware (5) Convex Hull (5) Crazyforcode (5) DFS - Multiple (5) DFS+DP (5) DP - Multi-Dimension (5) DP-Multiple Relation (5) Eulerian Cycle (5) Graph - Unusual (5) Graph Cycle (5) Hash Strategy (5) Immutability (5) Java (5) LogN (5) Manhattan Distance (5) Matrix Chain Multiplication (5) N Queens (5) Pre-Sort: Index (5) Quick Partition (5) Quora (5) Randomized Algorithms (5) Resources (5) Robot (5) SPFA(Shortest Path Faster Algorithm) (5) Shuffle (5) Sieve of Eratosthenes (5) Strongly Connected Components (5) Subarray Sum (5) Sudoku (5) Suffix Tree (5) Swap (5) Threaded (5) Tree - Creation (5) Warshall Floyd (5) Word Search (5) jiuzhang (5)

Popular Posts