Skip to content

Commit cec6287

Browse files
Add files via upload
1 parent be76e3f commit cec6287

File tree

1 file changed

+46
-33
lines changed

1 file changed

+46
-33
lines changed

9.Two Dimensional Lists/Largest Row or Column.ipynb

Lines changed: 46 additions & 33 deletions
Original file line numberDiff line numberDiff line change
@@ -63,42 +63,55 @@
6363
"metadata": {},
6464
"outputs": [],
6565
"source": [
66-
"min_value=-2147483648\n",
67-
"def findlargest(arr,nrow,ncol):\n",
68-
" isrow=True\n",
69-
" largetsum=min_value\n",
66+
"#Remove All Code From Coding Ninjas then apply\n",
67+
"from sys import stdin\n",
68+
"MIN_VALUE=-2147483648\n",
69+
"def findLargest(arr, nRows, mCols):\n",
70+
" #Your code goes here\n",
71+
" isRow =True\n",
72+
" largestSum=MIN_VALUE\n",
7073
" num=0\n",
71-
" for i in range(nrow):\n",
72-
" rowsum=0\n",
73-
" for j in range(ncol):\n",
74-
" rowsum+=arr[i][j]\n",
75-
" if rowsum>largetsum:\n",
76-
" largetsum=rowsum\n",
77-
" num=i\n",
78-
" for j in range(ncol):\n",
79-
" colsum=0\n",
80-
" for i in range(nrow):\n",
81-
" colsum+=arr[i][j]\n",
82-
" if colsum>largetsum:\n",
83-
" largetsum=colsum\n",
84-
" num=j\n",
85-
" isrow=False\n",
86-
" if isrow:\n",
87-
" print(f\"row {num} {largetsum}\")\n",
74+
" for i in range(nRows):\n",
75+
" rowSum=0\n",
76+
" for j in range(mCols):\n",
77+
" rowSum+=arr[i][j]\n",
78+
" if rowSum>largestSum:\n",
79+
" largestSum=rowSum\n",
80+
" num=i\n",
81+
" for j in range(mCols):\n",
82+
" colSum=0\n",
83+
" for i in range(nRows):\n",
84+
" colSum+=arr[i][j]\n",
85+
" if colSum>largestSum:\n",
86+
" largestSum=colSum\n",
87+
" num=j\n",
88+
" isRow=False\n",
89+
" if isRow:\n",
90+
" print(\"row \"+str(num)+\" \"+str(largestSum))\n",
8891
" else:\n",
89-
" print(f\"column {num} {largetsum}\")\n",
90-
"#taking input\n",
92+
" print(\"column \"+str(num)+\" \"+str(largestSum))\n",
93+
"#Taking Input Using Fast I/O\n",
94+
"def take2DInput() :\n",
95+
" li = stdin.readline().rstrip().split(\" \")\n",
96+
" nRows = int(li[0])\n",
97+
" mCols = int(li[1])\n",
98+
" \n",
99+
" if nRows == 0 :\n",
100+
" return list(), 0, 0\n",
101+
" \n",
102+
" mat = [list(map(int, input().strip().split(\" \"))) for row in range(nRows)]\n",
103+
" return mat, nRows, mCols\n",
104+
"\n",
105+
"\n",
91106
"#main\n",
92-
"loop=int(input())\n",
93-
"for i in range(loop):\n",
94-
" str=input().split()\n",
95-
" nrow,ncol=int(str[0]),int(str[1])\n",
96-
" arr=[]\n",
97-
" for j in range(nrow):\n",
98-
" b=input().split()\n",
99-
" li=[int(x) for x in b]\n",
100-
" arr.append(li)\n",
101-
" findlargest(arr,nrow,ncol)"
107+
"t = int(stdin.readline().rstrip())\n",
108+
"\n",
109+
"while t > 0 :\n",
110+
"\n",
111+
" mat, nRows, mCols = take2DInput()\n",
112+
" findLargest(mat, nRows, mCols)\n",
113+
"\n",
114+
" t -= 1"
102115
]
103116
}
104117
],

0 commit comments

Comments
 (0)