In C++, Write a class Field. h and Field. cpp that stores a 2-D array of integers. The following methods should be implemented:
Field( const vector> & )
Field( vector> && )
int Weight( int x1, int y1, int x2, int y2 )
This method returns the sum of all elements in the rectangle defined by the points (x1,y1) and (x2,y2).
Pay attention, the relative position of (x1,y1) and (x2,y2) can be any. If coordinates go beyond the array boundaries, throw the out_of_range exception.
The Weight function should be O(1) run time. To achieve this, you will need to do the precomputing in the constructors. Precomputing should be done in O(N) time and O(N) space. Here, N is the total number of the elements in the 2-D array.
For example, for the array below function Weight(1,2,4,0) returns 42. The selected rectangle is highlighted.
1 2 3 4 5 6
1 2 3 4 5 6
1 2 3 4 5 6
1 2 3 4 5 6
1 2 3 4 5 6
int PathCost()
This method computes the cost of the cheapest path from top-left corner of the field to the bottom-right corner. The only possible moves are right and down.
The function PathCost should be O(N) time.
For example, for the same 2-D array, PathCost() returns 25. The cheapest path is highlighted on the picture below.
1 2 3 4 5 6
1 2 3 4 5 6
1 2 3 4 5 6
1 2 3 4 5 6
1 2 3 4 5 6
Requirement: no explicit usage of pointers anywhere in your code please. Please comment code thoroughly as well.