add 1725

Author: clingoram

javascript/LeetCode/Array/1725.js

@@ -0,0 +1,46 @@
+/**
+ * 1725. Number Of Rectangles That Can Form The Largest Square
+ * 
+ * @param {number[][]} rectangles
+ * @return {number}
+ */
+var countGoodRectangles = function(rectangles) {
+    /**
+     * 2維陣列，每個陣列元素分別代表該陣列三角形的長l、寬w
+     * each rectangle are of lengths [5,3,5,5] is min of [l,w] 
+     * 回傳有幾個maxLen可組成三角形
+    */
+   // solution 1
+  //  let rectangleLen = [];
+  //  let countMaxLen = 0;
+  //  for(const eachLen of rectangles){
+  //     rectangleLen.push(parseInt(Math.min(...eachLen)));
+  //  }
+  // let maxLen = Math.max(...rectangleLen);
+  // for(let i = 0;i < rectangleLen.length;++i) {
+  //   if(rectangleLen[i] === maxLen){
+  //     countMaxLen++;
+  //   }
+  // }
+  // return countMaxLen;
+
+  // solution 2.
+  // time:O(N)
+  let count = 0, maxLen = 0;
+  for(const eachLen of rectangles) {
+    let side = Math.min(...eachLen);
+
+    if(side > maxLen){
+      count = 1;
+      maxLen = side;
+    }else if(side === maxLen){
+      count++;
+    }
+  }
+  return count;
+};
+let rectangles = [[5,8],[3,9],[5,12],[16,5]]
+// Output: 3
+// Explanation: The largest squares you can get from each rectangle are of lengths [5,3,5,5].
+// The largest possible square is of length 5, and you can get it out of 3 rectangles.
+console.log(countGoodRectangles(rectangles));

javascript/index.js

@@ -1508,4 +1508,6 @@ Query 0: The element at queries[0] = 0 is nums[0] = 1. The nearest index with th
 Query 1: The element at queries[1] = 3 is nums[3] = 4. No other index contains 4, so the result is -1.
 Query 2: The element at queries[2] = 5 is nums[5] = 3. The nearest index with the same value is 1, and the distance between them is 3 (following the circular path: 5 -> 6 -> 0 -> 1).
 */
-console.log(solveQueries(nums,queries));
+// console.log(solveQueries(nums,queries));
+
+