vaskes/algorithms
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

[bestSolution] min max with Left Rigth

Browse Source
This commit is contained in:
Vasily Guzov
2024-09-19 23:37:10 +03:00
parent c6b5b0bf9e
commit 4945a4128b
1 changed files with 43 additions and 28 deletions
Download Patch File Download Diff File Expand all files Collapse all files
lib/minMaxNumber.ts
+43 -28
View File
@@ -1,35 +1,50 @@
// export const min = (list: number[]): number => {
// const sortList = list.sort();
// let L = 0;
// let R = list.length - 1;
// let res = list[L];
// while (L <= R) {
// let currentMin = sortList[L] < sortList[R] ? sortList[L] : sortList[R];
// res = currentMin < res ? currentMin : res;
// L++;
// R--;
// }
// return res;
// };
// export const max = (list: number[]): number => {
// const sortList = list.sort();
// let L = 0;
// let R = list.length - 1;
// let res = list[L];
// while (L <= R) {
// let currentMax = sortList[L] > sortList[R] ? sortList[L] : sortList[R];
// res = currentMax > res ? currentMax : res;
// L++;
// R--;
// }
// return res;
// };
// const min = (list) => Math.min(...list);
// const max = (list) => Math.max(...list);
export const min = (list: number[]): number => {
const sortList = list.sort();
let L = 0;
let R = list.length - 1;
let res = list[L];
while (L <= R) {
let currentMin = sortList[L] < sortList[R] ? sortList[L] : sortList[R];
res = currentMin < res ? currentMin : res;
L++;
R--;
}
return res;
return list.sort((leftvalue, rightvalue): number => {
return leftvalue - rightvalue;
})[0];
};
export const max = (list: number[]): number => {
const sortList = list.sort();
let L = 0;
let R = list.length - 1;
let res = list[L];
while (L <= R) {
let currentMax = sortList[L] > sortList[R] ? sortList[L] : sortList[R];
res = currentMax > res ? currentMax : res;
L++;
R--;
}
return res;
return list.sort((leftvalue, rightvalue): number => {
return leftvalue - rightvalue;
})[list.length - 1];
};
console.log(min([-52, 56, 30, 29, -54, 0, -110]), -110);