FPEvalRepoPublic/LeetCodeMetaData

1{2  "id": 2328,3  "name": "minimize-result-by-adding-parentheses-to-expression",4  "difficulty": "Medium",5  "link": "https://leetcode.com/problems/minimize-result-by-adding-parentheses-to-expression/",6  "date": "2022-04-03",7  "task_description": "You are given a **0-indexed** string `expression` of the form `\"<num1>+<num2>\"` where `<num1>` and `<num2>` represent positive integers. Add a pair of parentheses to `expression` such that after the addition of parentheses, `expression` is a **valid** mathematical expression and evaluates to the **smallest** possible value. The left parenthesis **must** be added to the left of `'+'` and the right parenthesis **must** be added to the right of `'+'`. Return `expression`_ after adding a pair of parentheses such that _`expression`_ evaluates to the **smallest** possible value._ If there are multiple answers that yield the same result, return any of them. The input has been generated such that the original value of `expression`, and the value of `expression` after adding any pair of parentheses that meets the requirements fits within a signed 32-bit integer. **Example 1:** ``` **Input:** expression = \"247+38\" **Output:** \"2(47+38)\" **Explanation:** The `expression` evaluates to 2 * (47 + 38) = 2 * 85 = 170. Note that \"2(4)7+38\" is invalid because the right parenthesis must be to the right of the `'+'`. It can be shown that 170 is the smallest possible value. ``` **Example 2:** ``` **Input:** expression = \"12+34\" **Output:** \"1(2+3)4\" **Explanation:** The expression evaluates to 1 * (2 + 3) * 4 = 1 * 5 * 4 = 20. ``` **Example 3:** ``` **Input:** expression = \"999+999\" **Output:** \"(999+999)\" **Explanation:** The `expression` evaluates to 999 + 999 = 1998. ``` **Constraints:** `3 <= expression.length <= 10` `expression` consists of digits from `'1'` to `'9'` and `'+'`. `expression` starts and ends with digits. `expression` contains exactly one `'+'`. The original value of `expression`, and the value of `expression` after adding any pair of parentheses that meets the requirements fits within a signed 32-bit integer.",8  "test_case": [9    {10      "label": "Example 1",11      "input": "expression = \"247+38\"",12      "output": "\"2(47+38)\" "13    },14    {15      "label": "Example 2",16      "input": "expression = \"12+34\"",17      "output": "\"1(2+3)4\" "18    },19    {20      "label": "Example 3",21      "input": "expression = \"999+999\"",22      "output": "\"(999+999)\" "23    }24  ],25  "constraints": [26    "3 <= expression.length <= 10",27    "expression consists of digits from '1' to '9' and '+'.",28    "expression starts and ends with digits.",29    "expression contains exactly one '+'.",30    "The original value of expression, and the value of expression after adding any pair of parentheses that meets the requirements fits within a signed 32-bit integer."31  ],32  "python_template": "class Solution(object):\n    def minimizeResult(self, expression):\n        \"\"\"\n        :type expression: str\n        :rtype: str\n        \"\"\"\n        ",33  "java_template": "class Solution {\n    public String minimizeResult(String expression) {\n        \n    }\n}",34  "metadata": {35    "func_name": "minimizeResult"36  }37}