Finding the minimum steps to reach {m,n} in the grid [reviewed]

Problem

A robot has to move in a grid which is in the form of a matrix. It can go to 
1.) A(i,j) --> A(i+j,j) (Down) 
2.) A(i,j)-->A(i,i+j) (Right) 

Given it starts at (1,1) and it has to go to A(m,n), find the minimum number of STEPS it has to take to get to (m,n) and write 
public static int minSteps(int m,int n) 

For instance to go from (1,1) to m=3 and n=2 it has to take (1, 1) ->(1, 2) ->(3, 2) i.e. 2 steps


At first glance, it seems that it is a typical dynamic programming problem. It looks so especially because of this phrase "find the minimum number of STEPS". This is a trap.

If you think that there is multiple ways to get from (1,1) to (3,2), try to go backward from (3, 2) to (1,1) and see how ways exists. Let's try that manually.

1. From (3, 2),  (1, 2) is only prior step since down move results in bigger m values than n value.

2, From (1, 2),  (1,1) is the only prior step since only right move results in bigger n value than m value.

There is no other ways !!.

Therefore, we just trace back from (m, n) to (1,1) by checking each time whether it was from up or left position.


Here is the complete code in c++.



Practice statistics

12:00: misunderstood the question and got it wrong.  Later rewrote the code after understanding the question correctly.


UPDATE(2019-08-08): solved the problem again. Totally fooled by the word "minimum steps". There can be only one path exists. No multiple path !!


Practice statistics

1:14:56: to write the wrong dynamic programming code and rewrote the code after finding out the trick in the question.

Comments

Post a Comment

Popular posts from this blog

Planting flowers with no adjacent flower plots

Image
Problem Suppose you have a long flowerbed in which some of the plots are planted and some are not. However, flowers cannot be planted in adjacent plots - they would compete for water and both would die. Given a flowerbed (represented as an array containing booleans), return if a given number of new flowers can be planted in it without violating the no-adjacent-flowers rule  Sample inputs  Input: 1,0,0,0,0,0,1,0,0  3 => true  4 => false  Input: 1,0,0,1,0,0,1,0,0  1 => true  2 => false  input: 0  1 => true  2 => false  public boolean canPlaceFlowers(List flowerbed, int numberToPlace) {  // Implementation here  }
Read more
  Given an array of  intervals  where  intervals[i] = [start i , end i ] , merge all overlapping intervals, and return  an array of the non-overlapping intervals that cover all the intervals in the input . Example 1: Input: intervals = [[1,3],[2,6],[8,10],[15,18]] Output: [[1,6],[8,10],[15,18]] Explanation: Since intervals [1,3] and [2,6] overlap, merge them into [1,6]. Example 2: Input: intervals = [[1,4],[4,5]] Output: [[1,5]] Explanation: Intervals [1,4] and [4,5] are considered overlapping.   Constraints: 1 <= intervals.length <= 10 4 intervals[i].length == 2 0 <= start i <= end i <= 10 4
Read more

Find the maximum number of bomb that can be detonated

  Problem You are given a list of bombs. The range of a bomb is defined as the area where its effect can be felt. This area is in the shape of a circle with the center as the location of the bomb. The bombs are represented by a 0-indexed 2D integer array bombs where bombs[i] = [xi, yi, ri]. xi and yi denote the X-coordinate and Y-coordinate of the location of the ith bomb, whereas ri denotes the radius of its range. You may choose to detonate a single bomb. When a bomb is detonated, it will detonate all bombs that lie in its range.  These bombs will further detonate the bombs that lie in their ranges. Given the list of bombs, return the maximum number of bombs that can be detonated if you are allowed to detonate only one bomb. Input: bombs = [[2,1,3],[6,1,4]] Output: 2 Explanation: The above figure shows the positions and ranges of the 2 bombs. If we detonate the left bomb, the right bomb will not be affected. But if we detonate the right bomb, both bombs will be detonated. So...
Read more