address code review feedback

Author: seongmin36

find-minimum-in-rotated-sorted-array/seongmin36.js

@@ -12,9 +12,13 @@ function findMin(nums) {
   let left = 0;
   let right = nums.length - 1;
 
+  if (nums[left] <= nums[right]) return nums[left]; // 일자 배열인 경우
+
   while (left < right) {
     let mid = Math.floor((left + right) / 2);
 
+    if (nums[mid] > nums[mid + 1]) return nums[mid + 1]; // mid의 바로 옆에서 초기화되는 경우
+
     if (nums[mid] > nums[right]) {
       left = mid + 1;
     } else {

maximum-depth-of-binary-tree/seongmin36.js

@@ -21,7 +21,5 @@ function maxDepth(root) {
   let left_depth = maxDepth(root.left);
   let right_depth = maxDepth(root.right);
 
-  let count = Math.max(left_depth, right_depth) + 1;
-
-  return count;
+  return Math.max(left_depth, right_depth) + 1;
 }