Given a matrix, find the minimal path sum from the top left to the bottom right by only moving to the right and down.
x=[ 2 2 2 2 2
10 10 10 1 2
20 20 20 1 2
30 30 30 30 2]
Here, the minimum path sum is 14 [ 2+2+2+2+1+1+2+2 ]
Getting the indices from a vector
Find nth maximum
Find a Pythagorean triple
Maya - 03
En passant - 01
3rd side of a Triangle
Choose a web site to get translated content where available and see local events and offers. Based on your location, we recommend that you select: .
You can also select a web site from the following list:
Select the China site (in Chinese or English) for best site performance. Other MathWorks country sites are not optimized for visits from your location.
Contact your local office