[bestSolution] min max with Left Rigth

lib/minMaxNumber.ts

@@ -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];
+// 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;
+//   while (L <= R) {
+//     let currentMin = sortList[L] < sortList[R] ? sortList[L] : sortList[R];
+//     res = currentMin < res ? currentMin : res;
 
-    L++;
-    R--;
-  }
+//     L++;
+//     R--;
+//   }
 
-  return res;
-};
+//   return res;
+// };
 
-export const max = (list: number[]): number => {
-  const sortList = list.sort();
-  let L = 0;
-  let R = list.length - 1;
-  let res = list[L];
+// 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--;
+//   }
 
-  while (L <= R) {
-    let currentMax = sortList[L] > sortList[R] ? sortList[L] : sortList[R];
-    res = currentMax > res ? currentMax : res;
+//   return res;
+// };
 
-    L++;
-    R--;
-  }
+// const min = (list) => Math.min(...list);
+// const max = (list) => Math.max(...list);
 
-  return res;
+export const min = (list: number[]): number => {
+  return list.sort((leftvalue, rightvalue): number => {
+    return leftvalue - rightvalue;
+  })[0];
+};
+
+export const max = (list: number[]): number => {
+  return list.sort((leftvalue, rightvalue): number => {
+    return leftvalue - rightvalue;
+  })[list.length - 1];
 };
 
 console.log(min([-52, 56, 30, 29, -54, 0, -110]), -110);