test: 3000 solution

py, c++, go, java

Author: QuBenhao

problems/problems_3000/Solution.cpp

@@ -1,28 +1,38 @@
 //go:build ignore
 #include "cpp/common/Solution.h"
 
-
 using namespace std;
 using json = nlohmann::json;
 
 class Solution {
 public:
-    int areaOfMaxDiagonal(vector<vector<int>>& dimensions) {
-        
+  int areaOfMaxDiagonal(const vector<vector<int>> &dimensions) {
+    int max_length = 0, max_area = 0;
+    for (const auto &dim : dimensions) {
+      int a = dim[0], b = dim[1];
+      int length = a * a + b * b;
+      if (length > max_length) {
+        max_length = length;
+        max_area = a * b;
+      } else if (length == max_length) {
+        max_area = max(max_area, a * b);
+      }
     }
+    return max_area;
+  }
 };
 
 json leetcode::qubh::Solve(string input_json_values) {
-	vector<string> inputArray;
-	size_t pos = input_json_values.find('\n');
-	while (pos != string::npos) {
-		inputArray.push_back(input_json_values.substr(0, pos));
-		input_json_values = input_json_values.substr(pos + 1);
-		pos = input_json_values.find('\n');
-	}
-	inputArray.push_back(input_json_values);
+  vector<string> inputArray;
+  size_t pos = input_json_values.find('\n');
+  while (pos != string::npos) {
+    inputArray.push_back(input_json_values.substr(0, pos));
+    input_json_values = input_json_values.substr(pos + 1);
+    pos = input_json_values.find('\n');
+  }
+  inputArray.push_back(input_json_values);
 
-	Solution solution;
-	vector<vector<int>> dimensions = json::parse(inputArray.at(0));
-	return solution.areaOfMaxDiagonal(dimensions);
+  Solution solution;
+  vector<vector<int>> dimensions = json::parse(inputArray.at(0));
+  return solution.areaOfMaxDiagonal(dimensions);
 }

problems/problems_3000/Solution.java

@@ -7,7 +7,18 @@
 
 public class Solution extends BaseSolution {
     public int areaOfMaxDiagonal(int[][] dimensions) {
-        
+        int maxLength = 0, maxArea = 0;
+        for (int[] dim: dimensions) {
+            int a = dim[0], b = dim[1];
+            int length = a * a + b * b;
+            if (length > maxLength) {
+                maxLength = length;
+                maxArea = a * b;
+            } else if (length == maxLength) {
+                maxArea = Math.max(maxArea, a * b);
+            }
+        }
+        return maxArea;
     }
 
     @Override

problems/problems_3000/solution.go

@@ -6,8 +6,18 @@ import (
 	"strings"
 )
 
-func areaOfMaxDiagonal(dimensions [][]int) int {
-    
+func areaOfMaxDiagonal(dimensions [][]int) (ans int) {
+	maxLength := 0
+	for _, dimension := range dimensions {
+		a, b := dimension[0], dimension[1]
+		if length := a*a + b*b; length > maxLength {
+			maxLength = length
+			ans = a * b
+		} else if length == maxLength {
+			ans = max(ans, a*b)
+		}
+	}
+	return
 }
 
 func Solve(inputJsonValues string) any {

problems/problems_3000/solution.py

@@ -7,5 +7,11 @@ def solve(self, test_input=None):
         return self.areaOfMaxDiagonal(test_input)
 
     def areaOfMaxDiagonal(self, dimensions: List[List[int]]) -> int:
-        pass
-
+        max_length, max_area = 0, 0
+        for a, b in dimensions:
+            if (length := a * a + b * b) > max_length:
+                max_length = length
+                max_area = a * b
+            elif length == max_length:
+                max_area = max(max_area, a * b)
+        return max_area