00:01
Okay, this one says, write a method called the largest row that takes a 2d array of ints as a parameter and returns the number of the row that has the largest length.
00:10
For example, if the array is created by the quarter of love is this, then the value return would be row zero, i guess, because it's 45 .0.
00:26
So let's do this.
00:27
Important number is np.
00:29
What's the caps? import number is nip.
00:32
Let's say an array equal two, array.
00:38
And let's try to replicate what they have here.
00:41
So it's 10 to 45 to 3.
00:43
I'm going to assume it's 3 by 3 because they've got 9 in the count entries, so 8 to 42.
00:51
And finally, 321, 44.
00:58
Okay, so that's the array.
01:00
And what we're going to do is write a method, called the largest row, yeah, largest row, takes in array, it's called a in here, and what we're going to do is the term the number of the row that has the largest length.
01:18
Sorry, so it wants the row with the largest length.
01:22
So we're actually not going to use a mnpie for this, we're going to use nested lists...