Данный отчёт сгенерирован 10.02.2023 18:21:31 UTC.
HTML версия (этот сайт) сгенерирован 10.02.2023 18:21:38 UTC.
Коммит: [bfeb65b9] add automatic zip creation 10.02.2023 18:21:31
HTML версия (этот сайт) сгенерирован 10.02.2023 18:21:38 UTC.
Коммит: [bfeb65b9] add automatic zip creation 10.02.2023 18:21:31
Задача: Найбільший елемент масиву
10.02.2023 18:21:31
Описание: Визначте функцію maximum, яка отримує непустий масив і повертає значення найбільшого з його елементів.
10.02.2023 18:21:31
Решений: 177
10.02.2023 18:21:31
Найбільший елемент масиву
10.02.2023 18:21:31
const maximum = (m) => {
let element = m[0];
for(let i = 0; i < m.length; i++) {
if (element < m[i]) element = m[i];
}
return element;
}
function maximum(arr){
let max = arr[0];
for(let i = 0; i < arr.length; i++)
{
if(max < arr[i])
max = arr[i];
}
return max;
}
function maximum(m){
let a = m[0];
for(let i = 0; i < m.length; i++){
if (m[i] > a){
a = m[i];
}
}
return a;
}
function maximum(m){
let a = m[0];
for (let i = 0; i < m.length; i++) {
if (a < m[i]) {
a = m[i];
}
}
return a;
}
function maximum(m)
{
let max = m[0];
for (let i = 0; i < m.length; i++)
{
if (max < m[i])
max = m[i];
}
return max;
}
function maximum(m){
let max = m[0];
for (i = 0; i < m.length; ++i) {
if (m[i] > max) max = m[i];
}
return max;
}
console.log(maximum([1,12,3]));
function maximum(m){
let a=m[0]
for(let i=0;i< m.length;i++){
if(m[i]>a){
a=m[i]
}
}
return a
}
function maximum(m) {
let i = 0;
let max = m[i];
for(i = 1; i < m.length; i++) {
if(max < m[i])
max = m[i];
}
return max;
}
function maximum(m){
let max = m[0]
for (let o = 0; o < m.length; o++){
if (m[o] > max){
max = m[o]
}
}
return max
}
function maximum(m)
{
let sum = m[0];
for(let i = 0; i < m.length; i++)
{
if (sum < m[i])
sum = m[i];
}
return sum;
}
function maximum(a)
{
let max = a[0]
for (i = 0;i < a.length;i++)
{
if (a[i+1] > max) max = a[i+1]
}
return max
}
function maximum(m) {
let max = m[0];
for (let i = 0; i < m.length; i++){
if (max < m[i]) {
max = m[i];
}
}
return max;
}
function maximum(m) {
let max = m[0];
for(let i = 0; i < m.length; i++) {
if(max < m[i]){
max = m[i]
}
}
return max;
}
function maximum(m) {
let k = m.sort()
let p = m[m.length-1]
return p
}
function maximum(m){
let max = m[0];
for(let i = 0;i< m.length;i++){
if (m[i]>max){
max = m[i];
}
}
return max
}
function maximum(m) {
let i = 1
let max = m[0]
while (i < m.length) {
if (max <= m[i]) {
max = m[i]
}
i += 1
}
return max
}
function maximum(m){
let max = m[0];
for (let i = 0; i < m.length; i++){
if (max < m[i]){
max = m[i];
}
}
return max;
}
function maximum(m)
{
let max = m[0];
for (let i = 1; i < m.length; i++)
{
if (max < m[i])
{
max = m[i];
}
}
return max;
}
function maximum(m) {
let i = 0
let max = m[0]
while (i <= m.length) {
if (m[i] > max) {
max = m[i]
}
i++
}
return max
}
function maximum(m){
for (var i = 0; i < m.length; i++) {
if(m[i] > m[0]){
m[0] = m[i];
}
}
return (m[0]);
}
function maximum(m){
let arr = [];
let max = m [0];
for (let i = 0; i < m.length; i++)
if (max < m[i])
max = m [i]
return max
}
function maximum(m){
let max=m[0];
for(let i=0;i< m.length;i++){
if(max< m[i]){
max=m[i]
}
}
return max;
}
function maximum(m) {
let max = m[0];
for(let x of m) {
if (max < x) max = x;
}
return max;
}
function maximum(m){
if (m.length == 0){
return (undefined)
}
else {
let max = m[0];
for(i = 0 ; i < m.length; i++){
if (m[i] > max){
max = m[i]
}
}
return max
}
}
console.log (maximum([1,2,5,10]))
function maximum(m) {
m.sort(compare)
function compare(x, y){
return x-y
}
return m[m.length-1]
}
function maximum(m){
let max = m[0];
for (let i = 0; i < m.length; i++){
if (max < m[i]){
max = m[i]
}
}
return(max);
}
function maximum(m) {
let max=m[0];
for(let i=0;i {
if(m[i]>max) max=m[i];
}
return max;
}
function maximum(m)
{
let max = m[0];
for (let i = 0; i < m.length; i++)
{
if (m[i] > max)
max = m[i];
}
return max;
}
function maximum(m){
for(i=0; i< m.length; i++){
if (m[i]>m[0])
m[0]=m[i]
}
return m[0]
}
function maximum(m){
let max = m[0]
for ( let i = 1 ; i < m.length; i ++ ){
if ( m[i] >= max){
max = m[i]
}
}
return max
}
function maximum(m)
{
let max = m[0];
for(let i = 0; i< m.length; i++)
{
if(m[i] > max)
{
max = m[i];
}
}
return max;
}
function maximum(m)
{
let max = m[0];
for(let i=1;i< m.length;i++)
{
if(m[i]>max)
{
max=m[i];
}
}
return max;
}
function maximum(m)
{
let max = m[0];
for(let i = 1; i < m.length; i++)
m[i] > max ? max = m[i] : 0;
return max;
}
function maximum(m){
for(i=0; i< m.length; i++){
if (m[i]>m[0])
m[0]=m[i]
}
return m[0]
}
function maximum(m) {
let max = m[0];
for (let i = 1; i < m.length; i++) {
if (max < m[i]) {
max = m[i]
}
}
return max
}
function maximum(arr)
{
let max = arr[0];
for(i = 0; i < arr.length; i++)
{
if (arr[i] > max)
{
max = arr[i];
}
}
return(max);
}
function maximum(m) {
let i;
let max = m[0];
for (i = 1; i < m.length; i++) {
if (m[i] > max)
max = m[i];
}
return max;
}
function maximum(m)
{
let max = m[0];
for(let k = 1; k < m.length; k++)
{
if(max < m[k])
max = m[k];
}
return max;
}
function maximum(m){
let i = 0
let max = m[i]
while (i != m.length){
i++
if (max < m[i]){
max = m[i]
}
}
return max
}
function maximum(m)
{
let max = 0;
for(let i = 0; i < m.length; i ++)
{
if(m[i] > m[max])
{
max = i;
}
}
return m[max];
}
function maximum(m) {
let max = m[0]
for(let i = 0; i < m.length; i += 1) {
if( m[i] > max ) {
max = m[i]
}
}
return max;
}
let maximum = (m) => m.sort().pop()
function maximum(m)
{
let n = 0;
for (let i = n + 1; i < m.length; i++)
{
if (m[i] > m[n])
{
n = i;
}
}
return m[n]
}
function maximum(m) {
let max = m[0];
for(x of m) {
if(x > max)
max = x;
}
return max;
}
// Або
/*function maximum(m) {
let max = m[0];
for(let i = 1; i < m.length; i++) {
if(m[i] > max)
max = m[i];
}
return max;
}*/
// Або
/*function maximum(m) {
let max = m[0];
{
let i = 1;
while (i < m.length) {
if(m[i] > max)
max = m[i];
i++;
}
}
return max;
}*/
function maximum(m) {
let max = m[0];
for (i = 0; i < m.length; i++) {
if (max < m[i])
max = m[i];
}
return max;
}
function maximum(a)
{
let max = a[0];
for (let i =0; i < a.length; i++)
{
if (max < a[i])
max = a[i]
}
return max;
}
function maximum(m) {
min = m[0];
max = min;
for (i = 1; i < m.length; ++i) {
if (m[i] > max) max = m[i];
if (m[i] < min) min = m[i];
}
return max
}
function maximum(m){
let max = m[0];
for (let v of m){
if(v > max) max = v;
}
return max
}
function maximum(m) {
let max = m[0];
for(let i = 0; i < m.length; i++) {
if (max < m[i]) {
max = m[i];
}
}
return max;
}
function maximum ( m ) {
let a = [ ];
let max = m [ 0 ];
for ( let i = 1; i < m.length; i++ )
if ( max < m [i] )
max = m [i]
return max
}
function maximum(m)
{
max = m[0];
for(let i = 1;i <= m.length;i++)
{
if(max < m[i])
{
max = m[i];
}
}
return max;
}
function maximum(m){
let max = m[0];
for(let i = 0; i < m.length; i++){
if (m[i] > max){
max = m[i];
}
}
return max;
}
function maximum(m){
let i = 1;
let p = m[i-1];
p = m[i-1];
while (i<(m.length)){
if (p< m[i]){
p = m[i]
}
i++;
}
return p;
}
function maximum(m) {
for(let i = 0; i < m.length; i++){
if (m[i] > m[0])
m[0]=m[i]
}
return m[0]
}
function maximum(m) {
let n = m[0];
for(let i = 0; i < m.length; i++){
if(m[i] > n){
n = m[i];
}
}
return n;
}
function maximum(m) {
let res = m[0];
for (let i = 0; i < m.length; i++) {
let j = m[i];
if (j > res) {
res = j;
}
}
return res;
}
function maximum(m){
let max = m[0];
for(x of m ){
if(x > max)
max = x ;
}
return max;
}
function maximum(m) {
let max = m[0]
for (i = 0; i < m.length; i++) {
if (m[i] > max) {
max = m[i];
}
}
return max;
}
function maximum(m) {
let max = m[0];
for(let i =1;i {
if(m[i]>max)
{
max=m[i]
}
}
return max;
}
function maximum(m) {
let i;
let max = m[0];
for (i = 1; i < m.length; i++) {
if (m[i] > max)
max = m[i];
}
return max;
}
function maximum (m) {
let max = m[0];
for (let i = 0; i < m.length; i++) {
if (max < m[i]) {
max = m[i];
}
}
return max;
}
function maximum(m)
{
let max = m[0];
for(let i = 1; i < m.length; i++)
{
if(m[i] > max) max = m[i];
}
return max;
}
function maximum(m){
let max=m[0];
for(let i = 0;i< m.length;i++){
if(m[i]>max){
max = m[i];
}
}
return max;
}
function maximum(m){
let max = m[0]
for(let i = 1; i< m.length; i++){
if(m[i]> max)
max = m[i]
}
return max
}
function maximum(m)
{
let max = m[0];
for(let i = 0; i< m.length; i++)
{
if(m[i] > max)
{
max = m[i];
}
}
return max;
}
function maximum(m) {
let max = m[0];
for (let i = 0; i < m.length; i++) {
max = (max <= m[i])? m[i] : max;
}
return max;
}
function maximum(m) {
return m.reduce((max, current) => {return current > max? current: max}, m[0])
}
function maximum(m){
let max=m[0]
for (let i=0; i< m.length; i++){
if(m[i]>max){
max=m[i]
}
}
return max
}
function maximum(m){
let max = m[0];
for (let i = 0; i < m.length; i++) {
if (max < m[i]) max = m[i];
}
return max;
}
function maximum(m) {
let max = m[0];
let i = 0;
while (i < m.length) {
if (m[i] > max) {
max = m[i];
}
i++;
}
return max;
}
function maximum(m=[]){
let maxEl = m[0];
for(let i = 0; i < m.length; i++){
if (m[i] > maxEl){
maxEl = m[i];
}
}
return maxEl
let A = [1,2,3,4,5];
console.log(maximum(A));
}
function maximum(m){
max=m[0];
for (i=0; i< m.length; i++){
if (m[i]>max){
max=m[i];
}
}
return(max)
}
function maximum(m){
let max = m[0]
for(let i = 0; i < m.length; i++){
if (m[i] > max){
max = m[i]
}
}
return max
}
function maximum(m){
let max = m[0]
for ( i = 1; i < m.length; i++ ){
if ( m[i] > max ){
max = m[i]
}
}
return max
}
function maximum(m){
let max = m[0];
for(let i = 0; i < m.length; i++){
if(max < m[i]){
max = m[i];
}
}
return max;
}
maximum = m => m.sort((a,b) => a > b ? -1 : 1)[0]
maximum = m => m.sort((a, b) => a > b ? -1 : 1 )[0]
function maximum(m){
let max = m[0];
for(let e of m){
if(e > max){
max = e;
}
}
return max;
}
function maximum(m){
let max;
m.forEach(n => {
if(max === undefined){
max = n;
}
if(n > max){
max = n;
}
});
return max;
}
function maximum(m){
for (var i = 0; i < m.length; i++) {
if(m[i] > m[0]){
m[0] = m[i];
}
}
return (m[0]);
}
function maximum(m)
{
let max = m[0];
for(i = 1; i< m.length;i++)
{
if(m[i]>max) max = m[i];
}
return max;
}
function maximum (m)
{
let maxn = m[0];
for (let a = 1; a < m.length; a++ )
{
if ( m[a] > maxn )
{
maxn = m[a];
}
}
return maxn;
}
function maximum ( m ) {
let a = [ ];
let max = m [ 0 ];
for ( let i = 1; i < m.length; i++ )
if ( max < m [i] )
max = m [i]
return max
}
function maximum(m) {
let max = m[0];
for(let i = 0; i < m.length; i += 1) {
let a = m[i];
if (a > max) max = a;
}
return max;
}
function maximum(m) {
let max = m[0];
for(let i = 1; i < m.length; i++) {
if (max < m[i]) max = m[i];
}
return max;
}
function maximum(m){
let max = m[0];
for(let i in m){
if(m[i]>max) max = m[i];
}
return max;
}
function maximum(m){
let max_elem = m[0];
for (let num of m){
if (max_elem < num){
max_elem = num
}
}
return max_elem
}
function maximum(m)
{
let max=m[0];
let i = 1;
while (i < m.length)
{
if (max < m[i]) max = m[i];
i++;
}
return max;
}
function maximum(m) {
let max = m[0];
for (let i = 0 ; i < m.length ; i ++ )
{
if (m[i] > max)
{
max = m[i];
}
}
return max
}
function maximum(m){
let max = m[0];
for(let i=0; i < m.length; i++){
if(max< m[i]){
max=m[i]
}
}
return max
}
function maximum ( m ) {
let a = [ ];
let max = m [ 0 ];
for ( let i = 1; i < m.length; i++ )
if ( max < m [i] )
max = m [i]
return max
}
function maximum(m) {
let max = undefined;
for (let i = 0; i < m.length; i++)
if (max === undefined || m[i] > max)
max = m[i];
return max;
}
let m=[];
function maximum(m) {
let n = m.length;
for (let i = 0; i if (m[0]>m[1]){
m.splice(1,1);
}
else{
m.splice(0,1);
}
}
return m[0]
}
function maximum(m){
let max = m[0];
for(let i = 0; i < m.length;i++){
if(max < m[i]){
max = m[i];
}
}
return max;
}
console.log(maximum([1,12,3]));
function maximum(m){
let max = m[0]
for (let i = 0; i < m.length; i++){
if(m[i]>max){
max = m[i]
}
}
return max
}
function maximum ( m ) {
let n = [ ];
let max = m [ 0 ];
for ( let i = 1; i < m.length; i++ )
if ( max < m [i] )
max = m [i]
return max;
}
function maximum(m) {
return m.reduce((curr, acc) => {
if (curr > acc) return curr
else return acc
}, m[0])
}
function maximum(m) {
let max = m[0];
for (let i = 1; i < m.length; i++)
{
if(m[i] > max) max = m[i];
}
return max;
}
function maximum(m){
let max = m[0];
for(let i = 1; i < m.length; i++){
if(max< m[i]){
max = m[i];
}
}
return max;
}
function maximum(m){
let max = m[0];
for(let i = 0; i < m.length; i++)
{
if(m[i] > max)
max = m[i];
}
return max;
}
function maximum(m) {
let max=m[0];
for (let i=0; i<= m.length; i++){
if ( m[i]>max){
max=m[i];
}
}
return(max); }
function maximum(m){
let max = m[0];
for (i=1; i< m.length; i++){
if(max < m[i]){
max = m[i]
}
}
return max;
}
function maximum(m) {
let max = m[0]
for (let i = 0; i <= m.length; i++) {
if (m[i] > max){
max = m[i]
}
}
return max
}
function maximum(zxc){
let max = zxc[0]
for(let el in zxc){
if(max < zxc[el]) max = zxc[el]
}
return max;
}
function maximum(m) {
for(i=0; i< m.length; ++i) {
if(m[i]>m[0])
m[0] = m[i];
}
return m[0];
}
function maximum(m) {
let max = undefined;
for (let i = 0; i < m.length; i++)
if (max === undefined || m[i] > max)
max = m[i];
return max;
}
function maximum(m)
{
let max = m[0];
for(let i = 1; i < m.length; i++)
{
if(m[i] > max) max = m[i];
}
return max;
}
function maximum(m)
{
let max=m[0];
for (let i=1; i < m.length; i++)
{
if (m[i]>=max)
max=m[i];
}
return max;
}
function maximum(m) {
let max = m[0];
for (let i = 1; i < m.length; i++) {
if (max < m[i])
max = m[i]
}
return max;
}
function maximum(m)
{
let mx = m[0];
for(let i = 0; i <= m.length; i++)
{
if(m[i] > mx){
mx = m[i];
}
}
return(mx);
}
function maximum(m){
let max=m[0]
for (let i=0; i< m.length; i++){
if(m[i]>max){
max=m[i]
}
}
return max
}
function maximum (A = []) {
let max = A[0];
for (let i = 0; i < A.length; i++) {
if (max< A[i]) max=A[i];
}
return max;
}
function maximum(m) {
let max = m[0];
for (let i = 0; i < m.length; i++){
if (max < m[i]) {
max = m[i];
}
}
return max;
}
function maximum(m){
for(let i = 0; i < m.length; i++) {
if (m[i] > m[0]){
m[0] = m[i];
}
}
return m[0];
}
function maximum(m){
let max = m[0];
for(let i = 0; i <= m.length; i++){
if(max < m[i]){
max = m[i];
}
}
return max;
}
function maximum(m){
m.sort();
return m.slice(-1);
}
function maximum(m)
{
let max = m[0];
for (let i = 0; i < m.length; i++)
{
if (max < m[i])
max = m[i];
}
return max;
}
function maximum(m){
let num = m[0];
for (let i = 0; i < m.length; i++){
if(num < m[i]){
num = m[i];
}
}
return num;
}
function maximum(m){
let max = m[0];
for (let i = 0; i < m.length; i++){
if (max < m[i]){
max = m[i]
}
}
return max;
}
function maximum(m){
let max = m[0];
m.forEach(elem => {
if(elem > max){
max = elem;
}
});
return max;
}
function maximum(m)
{
max=m[0];
for(let i=1;i< m.length;i++)
if(m[i]>max)
max=m[i];
return max;
}
function maximum(m){
let s = m[0];
for (let i = 0; i < m.length; i++){
if (s < m[i])
s = m[i];
}
return s;
}
function maximum(m) {
let maximumVal = m[0];
for (const element of m) {
if (element > maximumVal) maximumVal = element;
}
return maximumVal;
}
function maximum(m)
{
let big = m[m.length-1]
for(let num = m.length - 2; num>=0; num--)
{
if(big < m[num])
{
big = m[num]
}
}
return big
}
function maximum(m){
let max = m[0];
for (let i = 1; i < m.length; i++) if (m[i] > max) max = m[i];
return max;
}
function maximum(m){
let max = m[0];
for (let i = 1; i <= m.length; i++){
if (m[i] > max){
max = m[i];
}
}
return max;
}
function maximum(m){
let max = m[0];
for (i=0; i < m.length; i++){
if (m[i] > max) {
max= m[i];
}
}
return (max)
}
function maximum(m){
function compare(x, y) {
return x - y;
}
let i = m.sort(compare);
return i[i.length - 1]
}
function maximum(m) {
let r = m[0];
for(let v of m) {
if(v > r) r = v;
}
return r;
}
function maximum(m){
for (var i = 0; i < m.length; i++) {
if(m[i] > m[0]){
m[0] = m[i];
}
}
return (m[0]);
}
function maximum(m){
let k=m[0];
for (let i=1; i< m.length; i++){
if (m[i]>k) k=m[i];
}
return (k);
}
function maximum(m){
let max = m[0]
let i = 1
while (i < m.length){
if (m[i] > max) max = m[i]
i++
}
return max
}
function maximum(arr) {
let max = arr[0];
for (i = 0; i < arr.length; i++) {
if (arr[i] > max) {
max = arr[i];
}
}
return (max)
}
function maximum(m)
{
let max = m[0];
for(let i = 0; i < m.length; i++)
{
if(max <= m[i])
max = m[i];
}
return max;
}
function maximum(m) {
let a = m[0];
let i = 0;
while (i< m.length) {
if (a< m[i])
a=m[i];
i++;
}
return a;
}
function maximum(m) {
let max = undefined;
for (let i = 0; i < m.length; i++)
if (max === undefined || m[i] > max)
max = m[i];
return max;
}
function maximum(m)
{
let max = m[0]
for(i=0; i < m.length; i++)
{
if (m[i] > max)
max = m[i]
}
return max
}
function maximum(m){
let max = m[0];
for(let i=0; i< m.length; i++){
if(max < m[i]){
max = m[i];
}
}
return(max);
}
function maximum(m)
{
let max = m[0]
for (i = 1; i < m.length; i++)
{
if (max < m[i])
{
max = m[i]
}
}
return max;
}
function maximum(m){
let max = m[0];
for(let i = 0; i < m.length; i++){
if (max < m[i]){
max = m[i];
}
}
return max;
}
function maximum(m){
let max = m[0];
for(let key in m){
if(max < m[key]) max = m[key]
}
return max;
}
function maximum(m)
{
let max = m[0]
for (let i = 1; i <= m.length; i++)
{
if (m[i]>max)
{
max = m[i]
}
}
return max
}
function maximum(m){
let mmax = m[0];
for (let i = 1; i < m.length; i++){
if(m[i] > mmax){
mmax = m[i];
}
}
return mmax;
}
function maximum(m){
let max = m[0];
for( i = 0; i < m.length ;i++ ){
if (m[i]> max ){
max = m[i]
}
}
return max
}
function maximum(m) {
let max = m[0];
for (i = 0; i < m.length; i++) {
if (m[i] > max) {
max = m[i];
}
}
return max;
}
function maximum(m){
let max = m[0];
for(let i=0; i < m.length; i++){
if(max< m[i]){
max=m[i]
}
}
return max
}
function maximum(m) {
let max = m[0];
for (i = 1; i <= m.length; i++) {
if (m[i] > max) {
max = m[i];
} else {}
}
return max;
}
function maximum(m) {
let max = m[0]
for (let i = 1; i < m.length; i++)
if (max < m[i])
max = m[i]
return max
}
function maximum(m) {
let k = m[0];
for(let i = 1; i < m.length; i++) {
if(m[i] > k)
k = m[i];
}
return k;
}
function maximum(m) {
let max=m[0];
for(let i=0;i {
if (m[i]>max)
max=m[i];
}
return max;
}
function maximum(m) {
let max = m[0];
for(i=0;i< m.length;++i){
if(m[i]>max){
max = m[i];
}
}
return(max)
}
function maximum(m){
m.sort()
return m[m.length-1]
}
function maximum(m){
let max = m[0]
for(let i = 0; i < m.length; i++){
if(m[i] > max){
max = m[i]
}
}
return max
}
function maximum(m) {
let r = m[0];
for(let v of m) {
if(v > r) r = v;
}
return r;
}
function maximum(m){
if(m.length==0){
return;
}
let max=m[0];
for(let i=0;i< m.length;i++){
if(m[i]>max){
max=m[i]
} }
return max;
}
function maximum(m) {
let max = m[0]
m.forEach(it => {
if (it > max) max = it
})
return max
}
function maximum(m){
let max = m[0];
for(let num of m){
if(max< num){
max = num;
}
}
return max;
}
function maximum(m){
let max = m[0];
for(let i = 1;i < m.length;i++){
if (max < m[i]){
max = m[i];
}
}
return max;
}
function maximum(m){
let save = m[0];
for(let i = 1; i < m.length; i++){
if(save < m[i]){
save = m[i];
}
}
return save;
}
function maximum(arr) {
let max = arr[0];
for (i = 0; i < arr.length; ++i) {
if (arr[i] > max) max = arr[i];
}
return (max)
}
function maximum(m){
let max = m [0];
for(const maximumElement of m){
if (maximumElement > max) max = maximumElement ;
}
return max;
}
function maximum(m){
let max = m[0]
for(let i of m){
if (i > max){
max = i
}
}
return max
}
function maximum(m)
{
let b = m[0]
for (a = 1; a <= m.length; a++)
{
if (m[a] > b)
{
b = m[a]
}
}
return b
}
function maximum(m)
{
let a = m[0];
for(let i = 0; i < m.length; i++)
{
if(a < m[i])
{
a = m[i];
}
}
return a;
}
function maximum(m){
let max = m[0];
for(let i = 0; i < m.length; i++){
if (m[i] > max){
max = m[i];
}
}
return max;
}
function maximum(m) {
let max=m[0]
for (let i=0; i< m.length; i++) {
if (m[i]>max) max=m[i]
}
return max
}
function maximum(m)
{
let max = m[0];
for(let i = 0; i < m.length; i++)
{
if(max < m[i]){
max = m[i]
}
}
return max;
}
function maximum(m){
let max = m[0];
for (let i = 0; i < m.length; i++){
if (max < m[i]){
max = m[i]
}
}
return max;
}
function maximum(arr) {
let max = arr[0];
for (let i = 1; i < arr.length; i++) {
if (arr[i] > max) {
max = arr[i];
}
}
return max;
}
function maximum(m){
let max = m[0];
for(i=0;i<=m.length;i++){
if(m[i]>max){
max = m[i];
}
}
return max;
}
function maximum(m){
m.sort();
return m.pop();
}
function maximum(m){
let max = m[0];
for(i=0;i<=m.length;i++){
if(m[i]>max){
max = m[i];
}
}
return max;
}
function maximum(m) {
let maximum = m[0];
for (let i in m) {
if (m[i]>maximum) {
maximum = m[i];
}
}
return maximum;
}
function maximum(m){
let max = m[0];
for(let i = 1; i < m.length; i++){
if (m[i] > max)
{
max = m[i]
}
}
return max;
}
function maximum(m){
let max = m[0];
for(let i = 0; i < m.length; i++){
if (m[i] > max){
max = m[i]
}
}
return max;
}
function maximum(m) {
let max = undefined;
for (let i = 0; i < m.length; i++)
if (max === undefined || m[i] > max)
max = m[i];
return max;
}
function maximum(m) {
let maxN = m[0];
for (i = 1; i < m.length; ++i) {
if (m[i] > maxN) {
maxN = m[i];
}
}
return maxN;
}
let element = m[0];
for(let i = 0; i < m.length; i++) {
if (element < m[i]) element = m[i];
}
return element;
}
let max = arr[0];
for(let i = 0; i < arr.length; i++)
{
if(max < arr[i])
max = arr[i];
}
return max;
}
let a = m[0];
for(let i = 0; i < m.length; i++){
if (m[i] > a){
a = m[i];
}
}
return a;
}
let a = m[0];
for (let i = 0; i < m.length; i++) {
if (a < m[i]) {
a = m[i];
}
}
return a;
}
{
let max = m[0];
for (let i = 0; i < m.length; i++)
{
if (max < m[i])
max = m[i];
}
return max;
}
let max = m[0];
for (i = 0; i < m.length; ++i) {
if (m[i] > max) max = m[i];
}
return max;
}
console.log(maximum([1,12,3]));
let a=m[0]
for(let i=0;i< m.length;i++){
if(m[i]>a){
a=m[i]
}
}
return a
}
let i = 0;
let max = m[i];
for(i = 1; i < m.length; i++) {
if(max < m[i])
max = m[i];
}
return max;
}
let max = m[0]
for (let o = 0; o < m.length; o++){
if (m[o] > max){
max = m[o]
}
}
return max
}
{
let sum = m[0];
for(let i = 0; i < m.length; i++)
{
if (sum < m[i])
sum = m[i];
}
return sum;
}
{
let max = a[0]
for (i = 0;i < a.length;i++)
{
if (a[i+1] > max) max = a[i+1]
}
return max
}
let max = m[0];
for (let i = 0; i < m.length; i++){
if (max < m[i]) {
max = m[i];
}
}
return max;
}
let max = m[0];
for(let i = 0; i < m.length; i++) {
if(max < m[i]){
max = m[i]
}
}
return max;
}
let k = m.sort()
let p = m[m.length-1]
return p
}
let max = m[0];
for(let i = 0;i< m.length;i++){
if (m[i]>max){
max = m[i];
}
}
return max
}
let i = 1
let max = m[0]
while (i < m.length) {
if (max <= m[i]) {
max = m[i]
}
i += 1
}
return max
}
let max = m[0];
for (let i = 0; i < m.length; i++){
if (max < m[i]){
max = m[i];
}
}
return max;
}
{
let max = m[0];
for (let i = 1; i < m.length; i++)
{
if (max < m[i])
{
max = m[i];
}
}
return max;
}
let i = 0
let max = m[0]
while (i <= m.length) {
if (m[i] > max) {
max = m[i]
}
i++
}
return max
}
for (var i = 0; i < m.length; i++) {
if(m[i] > m[0]){
m[0] = m[i];
}
}
return (m[0]);
}
let arr = [];
let max = m [0];
for (let i = 0; i < m.length; i++)
if (max < m[i])
max = m [i]
return max
}
let max=m[0];
for(let i=0;i< m.length;i++){
if(max< m[i]){
max=m[i]
}
}
return max;
}
let max = m[0];
for(let x of m) {
if (max < x) max = x;
}
return max;
}
if (m.length == 0){
return (undefined)
}
else {
let max = m[0];
for(i = 0 ; i < m.length; i++){
if (m[i] > max){
max = m[i]
}
}
return max
}
}
console.log (maximum([1,2,5,10]))
m.sort(compare)
function compare(x, y){
return x-y
}
return m[m.length-1]
}
let max = m[0];
for (let i = 0; i < m.length; i++){
if (max < m[i]){
max = m[i]
}
}
return(max);
}
let max=m[0];
for(let i=0;i
if(m[i]>max) max=m[i];
}
return max;
}
{
let max = m[0];
for (let i = 0; i < m.length; i++)
{
if (m[i] > max)
max = m[i];
}
return max;
}
for(i=0; i< m.length; i++){
if (m[i]>m[0])
m[0]=m[i]
}
return m[0]
}
let max = m[0]
for ( let i = 1 ; i < m.length; i ++ ){
if ( m[i] >= max){
max = m[i]
}
}
return max
}
{
let max = m[0];
for(let i = 0; i< m.length; i++)
{
if(m[i] > max)
{
max = m[i];
}
}
return max;
}
{
let max = m[0];
for(let i=1;i< m.length;i++)
{
if(m[i]>max)
{
max=m[i];
}
}
return max;
}
{
let max = m[0];
for(let i = 1; i < m.length; i++)
m[i] > max ? max = m[i] : 0;
return max;
}
for(i=0; i< m.length; i++){
if (m[i]>m[0])
m[0]=m[i]
}
return m[0]
}
let max = m[0];
for (let i = 1; i < m.length; i++) {
if (max < m[i]) {
max = m[i]
}
}
return max
}
{
let max = arr[0];
for(i = 0; i < arr.length; i++)
{
if (arr[i] > max)
{
max = arr[i];
}
}
return(max);
}
let i;
let max = m[0];
for (i = 1; i < m.length; i++) {
if (m[i] > max)
max = m[i];
}
return max;
}
{
let max = m[0];
for(let k = 1; k < m.length; k++)
{
if(max < m[k])
max = m[k];
}
return max;
}
let i = 0
let max = m[i]
while (i != m.length){
i++
if (max < m[i]){
max = m[i]
}
}
return max
}
{
let max = 0;
for(let i = 0; i < m.length; i ++)
{
if(m[i] > m[max])
{
max = i;
}
}
return m[max];
}
let max = m[0]
for(let i = 0; i < m.length; i += 1) {
if( m[i] > max ) {
max = m[i]
}
}
return max;
}
{
let n = 0;
for (let i = n + 1; i < m.length; i++)
{
if (m[i] > m[n])
{
n = i;
}
}
return m[n]
}
let max = m[0];
for(x of m) {
if(x > max)
max = x;
}
return max;
}
// Або
/*function maximum(m) {
let max = m[0];
for(let i = 1; i < m.length; i++) {
if(m[i] > max)
max = m[i];
}
return max;
}*/
// Або
/*function maximum(m) {
let max = m[0];
{
let i = 1;
while (i < m.length) {
if(m[i] > max)
max = m[i];
i++;
}
}
return max;
}*/
let max = m[0];
for (i = 0; i < m.length; i++) {
if (max < m[i])
max = m[i];
}
return max;
}
{
let max = a[0];
for (let i =0; i < a.length; i++)
{
if (max < a[i])
max = a[i]
}
return max;
}
min = m[0];
max = min;
for (i = 1; i < m.length; ++i) {
if (m[i] > max) max = m[i];
if (m[i] < min) min = m[i];
}
return max
}
let max = m[0];
for (let v of m){
if(v > max) max = v;
}
return max
}
let max = m[0];
for(let i = 0; i < m.length; i++) {
if (max < m[i]) {
max = m[i];
}
}
return max;
}
let a = [ ];
let max = m [ 0 ];
for ( let i = 1; i < m.length; i++ )
if ( max < m [i] )
max = m [i]
return max
}
{
max = m[0];
for(let i = 1;i <= m.length;i++)
{
if(max < m[i])
{
max = m[i];
}
}
return max;
}
let max = m[0];
for(let i = 0; i < m.length; i++){
if (m[i] > max){
max = m[i];
}
}
return max;
}
let i = 1;
let p = m[i-1];
p = m[i-1];
while (i<(m.length)){
if (p< m[i]){
p = m[i]
}
i++;
}
return p;
}
for(let i = 0; i < m.length; i++){
if (m[i] > m[0])
m[0]=m[i]
}
return m[0]
}
let n = m[0];
for(let i = 0; i < m.length; i++){
if(m[i] > n){
n = m[i];
}
}
return n;
}
let res = m[0];
for (let i = 0; i < m.length; i++) {
let j = m[i];
if (j > res) {
res = j;
}
}
return res;
}
let max = m[0];
for(x of m ){
if(x > max)
max = x ;
}
return max;
}
let max = m[0]
for (i = 0; i < m.length; i++) {
if (m[i] > max) {
max = m[i];
}
}
return max;
}
let max = m[0];
for(let i =1;i
if(m[i]>max)
{
max=m[i]
}
}
return max;
}
let i;
let max = m[0];
for (i = 1; i < m.length; i++) {
if (m[i] > max)
max = m[i];
}
return max;
}
let max = m[0];
for (let i = 0; i < m.length; i++) {
if (max < m[i]) {
max = m[i];
}
}
return max;
}
{
let max = m[0];
for(let i = 1; i < m.length; i++)
{
if(m[i] > max) max = m[i];
}
return max;
}
let max=m[0];
for(let i = 0;i< m.length;i++){
if(m[i]>max){
max = m[i];
}
}
return max;
}
let max = m[0]
for(let i = 1; i< m.length; i++){
if(m[i]> max)
max = m[i]
}
return max
}
{
let max = m[0];
for(let i = 0; i< m.length; i++)
{
if(m[i] > max)
{
max = m[i];
}
}
return max;
}
let max = m[0];
for (let i = 0; i < m.length; i++) {
max = (max <= m[i])? m[i] : max;
}
return max;
}
return m.reduce((max, current) => {return current > max? current: max}, m[0])
}
let max=m[0]
for (let i=0; i< m.length; i++){
if(m[i]>max){
max=m[i]
}
}
return max
}
let max = m[0];
for (let i = 0; i < m.length; i++) {
if (max < m[i]) max = m[i];
}
return max;
}
let max = m[0];
let i = 0;
while (i < m.length) {
if (m[i] > max) {
max = m[i];
}
i++;
}
return max;
}
let maxEl = m[0];
for(let i = 0; i < m.length; i++){
if (m[i] > maxEl){
maxEl = m[i];
}
}
return maxEl
let A = [1,2,3,4,5];
console.log(maximum(A));
}
max=m[0];
for (i=0; i< m.length; i++){
if (m[i]>max){
max=m[i];
}
}
return(max)
}
let max = m[0]
for(let i = 0; i < m.length; i++){
if (m[i] > max){
max = m[i]
}
}
return max
}
let max = m[0]
for ( i = 1; i < m.length; i++ ){
if ( m[i] > max ){
max = m[i]
}
}
return max
}
let max = m[0];
for(let i = 0; i < m.length; i++){
if(max < m[i]){
max = m[i];
}
}
return max;
}
let max = m[0];
for(let e of m){
if(e > max){
max = e;
}
}
return max;
}
let max;
m.forEach(n => {
if(max === undefined){
max = n;
}
if(n > max){
max = n;
}
});
return max;
}
for (var i = 0; i < m.length; i++) {
if(m[i] > m[0]){
m[0] = m[i];
}
}
return (m[0]);
}
{
let max = m[0];
for(i = 1; i< m.length;i++)
{
if(m[i]>max) max = m[i];
}
return max;
}
{
let maxn = m[0];
for (let a = 1; a < m.length; a++ )
{
if ( m[a] > maxn )
{
maxn = m[a];
}
}
return maxn;
}
let a = [ ];
let max = m [ 0 ];
for ( let i = 1; i < m.length; i++ )
if ( max < m [i] )
max = m [i]
return max
}
let max = m[0];
for(let i = 0; i < m.length; i += 1) {
let a = m[i];
if (a > max) max = a;
}
return max;
}
let max = m[0];
for(let i = 1; i < m.length; i++) {
if (max < m[i]) max = m[i];
}
return max;
}
let max = m[0];
for(let i in m){
if(m[i]>max) max = m[i];
}
return max;
}
let max_elem = m[0];
for (let num of m){
if (max_elem < num){
max_elem = num
}
}
return max_elem
}
{
let max=m[0];
let i = 1;
while (i < m.length)
{
if (max < m[i]) max = m[i];
i++;
}
return max;
}
let max = m[0];
for (let i = 0 ; i < m.length ; i ++ )
{
if (m[i] > max)
{
max = m[i];
}
}
return max
}
let max = m[0];
for(let i=0; i < m.length; i++){
if(max< m[i]){
max=m[i]
}
}
return max
}
let a = [ ];
let max = m [ 0 ];
for ( let i = 1; i < m.length; i++ )
if ( max < m [i] )
max = m [i]
return max
}
let max = undefined;
for (let i = 0; i < m.length; i++)
if (max === undefined || m[i] > max)
max = m[i];
return max;
}
function maximum(m) {
let n = m.length;
for (let i = 0; i
m.splice(1,1);
}
else{
m.splice(0,1);
}
}
return m[0]
}
let max = m[0];
for(let i = 0; i < m.length;i++){
if(max < m[i]){
max = m[i];
}
}
return max;
}
console.log(maximum([1,12,3]));
let max = m[0]
for (let i = 0; i < m.length; i++){
if(m[i]>max){
max = m[i]
}
}
return max
}
let n = [ ];
let max = m [ 0 ];
for ( let i = 1; i < m.length; i++ )
if ( max < m [i] )
max = m [i]
return max;
}
return m.reduce((curr, acc) => {
if (curr > acc) return curr
else return acc
}, m[0])
}
let max = m[0];
for (let i = 1; i < m.length; i++)
{
if(m[i] > max) max = m[i];
}
return max;
}
let max = m[0];
for(let i = 1; i < m.length; i++){
if(max< m[i]){
max = m[i];
}
}
return max;
}
let max = m[0];
for(let i = 0; i < m.length; i++)
{
if(m[i] > max)
max = m[i];
}
return max;
}
let max=m[0];
for (let i=0; i<= m.length; i++){
if ( m[i]>max){
max=m[i];
}
}
return(max); }
let max = m[0];
for (i=1; i< m.length; i++){
if(max < m[i]){
max = m[i]
}
}
return max;
}
let max = m[0]
for (let i = 0; i <= m.length; i++) {
if (m[i] > max){
max = m[i]
}
}
return max
}
let max = zxc[0]
for(let el in zxc){
if(max < zxc[el]) max = zxc[el]
}
return max;
}
for(i=0; i< m.length; ++i) {
if(m[i]>m[0])
m[0] = m[i];
}
return m[0];
}
let max = undefined;
for (let i = 0; i < m.length; i++)
if (max === undefined || m[i] > max)
max = m[i];
return max;
}
{
let max = m[0];
for(let i = 1; i < m.length; i++)
{
if(m[i] > max) max = m[i];
}
return max;
}
{
let max=m[0];
for (let i=1; i < m.length; i++)
{
if (m[i]>=max)
max=m[i];
}
return max;
}
let max = m[0];
for (let i = 1; i < m.length; i++) {
if (max < m[i])
max = m[i]
}
return max;
}
{
let mx = m[0];
for(let i = 0; i <= m.length; i++)
{
if(m[i] > mx){
mx = m[i];
}
}
return(mx);
}
let max=m[0]
for (let i=0; i< m.length; i++){
if(m[i]>max){
max=m[i]
}
}
return max
}
let max = A[0];
for (let i = 0; i < A.length; i++) {
if (max< A[i]) max=A[i];
}
return max;
}
let max = m[0];
for (let i = 0; i < m.length; i++){
if (max < m[i]) {
max = m[i];
}
}
return max;
}
for(let i = 0; i < m.length; i++) {
if (m[i] > m[0]){
m[0] = m[i];
}
}
return m[0];
}
let max = m[0];
for(let i = 0; i <= m.length; i++){
if(max < m[i]){
max = m[i];
}
}
return max;
}
m.sort();
return m.slice(-1);
}
{
let max = m[0];
for (let i = 0; i < m.length; i++)
{
if (max < m[i])
max = m[i];
}
return max;
}
let num = m[0];
for (let i = 0; i < m.length; i++){
if(num < m[i]){
num = m[i];
}
}
return num;
}
let max = m[0];
for (let i = 0; i < m.length; i++){
if (max < m[i]){
max = m[i]
}
}
return max;
}
let max = m[0];
m.forEach(elem => {
if(elem > max){
max = elem;
}
});
return max;
}
{
max=m[0];
for(let i=1;i< m.length;i++)
if(m[i]>max)
max=m[i];
return max;
}
let s = m[0];
for (let i = 0; i < m.length; i++){
if (s < m[i])
s = m[i];
}
return s;
}
let maximumVal = m[0];
for (const element of m) {
if (element > maximumVal) maximumVal = element;
}
return maximumVal;
}
{
let big = m[m.length-1]
for(let num = m.length - 2; num>=0; num--)
{
if(big < m[num])
{
big = m[num]
}
}
return big
}
let max = m[0];
for (let i = 1; i < m.length; i++) if (m[i] > max) max = m[i];
return max;
}
let max = m[0];
for (let i = 1; i <= m.length; i++){
if (m[i] > max){
max = m[i];
}
}
return max;
}
let max = m[0];
for (i=0; i < m.length; i++){
if (m[i] > max) {
max= m[i];
}
}
return (max)
}
function compare(x, y) {
return x - y;
}
let i = m.sort(compare);
return i[i.length - 1]
}
let r = m[0];
for(let v of m) {
if(v > r) r = v;
}
return r;
}
for (var i = 0; i < m.length; i++) {
if(m[i] > m[0]){
m[0] = m[i];
}
}
return (m[0]);
}
let k=m[0];
for (let i=1; i< m.length; i++){
if (m[i]>k) k=m[i];
}
return (k);
}
let max = m[0]
let i = 1
while (i < m.length){
if (m[i] > max) max = m[i]
i++
}
return max
}
let max = arr[0];
for (i = 0; i < arr.length; i++) {
if (arr[i] > max) {
max = arr[i];
}
}
return (max)
}
{
let max = m[0];
for(let i = 0; i < m.length; i++)
{
if(max <= m[i])
max = m[i];
}
return max;
}
let a = m[0];
let i = 0;
while (i< m.length) {
if (a< m[i])
a=m[i];
i++;
}
return a;
}
let max = undefined;
for (let i = 0; i < m.length; i++)
if (max === undefined || m[i] > max)
max = m[i];
return max;
}
{
let max = m[0]
for(i=0; i < m.length; i++)
{
if (m[i] > max)
max = m[i]
}
return max
}
let max = m[0];
for(let i=0; i< m.length; i++){
if(max < m[i]){
max = m[i];
}
}
return(max);
}
{
let max = m[0]
for (i = 1; i < m.length; i++)
{
if (max < m[i])
{
max = m[i]
}
}
return max;
}
let max = m[0];
for(let i = 0; i < m.length; i++){
if (max < m[i]){
max = m[i];
}
}
return max;
}
let max = m[0];
for(let key in m){
if(max < m[key]) max = m[key]
}
return max;
}
{
let max = m[0]
for (let i = 1; i <= m.length; i++)
{
if (m[i]>max)
{
max = m[i]
}
}
return max
}
let mmax = m[0];
for (let i = 1; i < m.length; i++){
if(m[i] > mmax){
mmax = m[i];
}
}
return mmax;
}
let max = m[0];
for( i = 0; i < m.length ;i++ ){
if (m[i]> max ){
max = m[i]
}
}
return max
}
let max = m[0];
for (i = 0; i < m.length; i++) {
if (m[i] > max) {
max = m[i];
}
}
return max;
}
let max = m[0];
for(let i=0; i < m.length; i++){
if(max< m[i]){
max=m[i]
}
}
return max
}
let max = m[0];
for (i = 1; i <= m.length; i++) {
if (m[i] > max) {
max = m[i];
} else {}
}
return max;
}
let max = m[0]
for (let i = 1; i < m.length; i++)
if (max < m[i])
max = m[i]
return max
}
let k = m[0];
for(let i = 1; i < m.length; i++) {
if(m[i] > k)
k = m[i];
}
return k;
}
let max=m[0];
for(let i=0;i
if (m[i]>max)
max=m[i];
}
return max;
}
let max = m[0];
for(i=0;i< m.length;++i){
if(m[i]>max){
max = m[i];
}
}
return(max)
}
m.sort()
return m[m.length-1]
}
let max = m[0]
for(let i = 0; i < m.length; i++){
if(m[i] > max){
max = m[i]
}
}
return max
}
let r = m[0];
for(let v of m) {
if(v > r) r = v;
}
return r;
}
if(m.length==0){
return;
}
let max=m[0];
for(let i=0;i< m.length;i++){
if(m[i]>max){
max=m[i]
} }
return max;
}
let max = m[0]
m.forEach(it => {
if (it > max) max = it
})
return max
}
let max = m[0];
for(let num of m){
if(max< num){
max = num;
}
}
return max;
}
let max = m[0];
for(let i = 1;i < m.length;i++){
if (max < m[i]){
max = m[i];
}
}
return max;
}
let save = m[0];
for(let i = 1; i < m.length; i++){
if(save < m[i]){
save = m[i];
}
}
return save;
}
let max = arr[0];
for (i = 0; i < arr.length; ++i) {
if (arr[i] > max) max = arr[i];
}
return (max)
}
let max = m [0];
for(const maximumElement of m){
if (maximumElement > max) max = maximumElement ;
}
return max;
}
let max = m[0]
for(let i of m){
if (i > max){
max = i
}
}
return max
}
{
let b = m[0]
for (a = 1; a <= m.length; a++)
{
if (m[a] > b)
{
b = m[a]
}
}
return b
}
{
let a = m[0];
for(let i = 0; i < m.length; i++)
{
if(a < m[i])
{
a = m[i];
}
}
return a;
}
let max = m[0];
for(let i = 0; i < m.length; i++){
if (m[i] > max){
max = m[i];
}
}
return max;
}
let max=m[0]
for (let i=0; i< m.length; i++) {
if (m[i]>max) max=m[i]
}
return max
}
{
let max = m[0];
for(let i = 0; i < m.length; i++)
{
if(max < m[i]){
max = m[i]
}
}
return max;
}
let max = m[0];
for (let i = 0; i < m.length; i++){
if (max < m[i]){
max = m[i]
}
}
return max;
}
let max = arr[0];
for (let i = 1; i < arr.length; i++) {
if (arr[i] > max) {
max = arr[i];
}
}
return max;
}
let max = m[0];
for(i=0;i<=m.length;i++){
if(m[i]>max){
max = m[i];
}
}
return max;
}
m.sort();
return m.pop();
}
let max = m[0];
for(i=0;i<=m.length;i++){
if(m[i]>max){
max = m[i];
}
}
return max;
}
let maximum = m[0];
for (let i in m) {
if (m[i]>maximum) {
maximum = m[i];
}
}
return maximum;
}
let max = m[0];
for(let i = 1; i < m.length; i++){
if (m[i] > max)
{
max = m[i]
}
}
return max;
}
let max = m[0];
for(let i = 0; i < m.length; i++){
if (m[i] > max){
max = m[i]
}
}
return max;
}
let max = undefined;
for (let i = 0; i < m.length; i++)
if (max === undefined || m[i] > max)
max = m[i];
return max;
}
let maxN = m[0];
for (i = 1; i < m.length; ++i) {
if (m[i] > maxN) {
maxN = m[i];
}
}
return maxN;
}