给定2D数组,数组的元素为0和1。对所有行进行排序。我们必须找到最大为1的行。这里我们使用map()。map函数是用于函数编程的Python内置函数中最简单的一个。这些工具将函数应用于序列和其他可迭代项。
Input Array is [[0, 1, 1, 1, 1],[0, 0, 1, 1, 1],[1, 1, 1, 1, 1],[0, 0, 0, 0, 1]] The maximum number of 1's = 2
Step 1: sum of on each row of the matrix using map function. Step 2: it will return a list of sum of all one's in each row. Step 3: then print index of maximum sum in a list.
# Python program to find the row with maximum number of 1's def maximumofones(n): max1 = list(map(sum,n)) print ("MAXIMUM NUMBER OF 1's ::>",max1.index(max(max1))) # Driver program if __name__ == "__main__": n = [[0, 1, 1, 1, 1],[0, 0, 1, 1, 1],[1, 1, 1, 1, 1],[0, 0, 0, 0, 1]] maximumofones(n)
输出结果
MAXIMUM NUMBER OF 1's ::> 2