You are given a AB character matrix named C. Every cell in C has a character U,R,L or D indicating up,right,left and down.
Your target is to go from top left corner to the bottom right corner of the matrix.
But there are some restrictions while moving along the matrix:
Like: If a cell contains character U and you go right instead of Up you have to pay 1 unit of cost.
So your task is to find the minimum cost to go from top-left corner to the bottom-right corner.
Return an integer denoting the minimum cost to travel from top-left corner to bottom-right corner.
A = 3 B = 3 C = ["RRR","DDD","UUU"]
A = 1 B = 4 C = ["LLLL"]
Explanation for Input-1:
Matrix looks like: RRR DDD UUU We go right two times and down two times. So from top-right cell we are going down though right is given so this incurs a cost of 1.
Explanation for Input-2:
Matrix looks like: LLLL We go right three times.
NOTE: You only need to implement the given function. Do not read input, instead use the arguments to the function. Do not print the output, instead return values as specified. Still have a doubt? Checkout Sample Codes for more details.