C++: Max Product in a Matrix witout Backtrack
Problem
Given a matrix, find the path from top left to bottom right with the greatest product by moving only down and right.
The code is in C++.
The only moves allowed are down and right. The solution works for positive numbers.
Reference
Written with StackEdit.
Categories
Advertisements
