241. Different Ways to Add Parentheses java solutions

Given a string of numbers and operators, return all possible results from computing all the different possible ways to group numbers and operators. The valid operators are+- and *.

Example 1

Input: "2-1-1".

((2-1)-1) = 0
(2-(1-1)) = 2

Output: [0, 2]

Example 2

Input: "2*3-4*5"

(2*(3-(4*5))) = -34
((2*3)-(4*5)) = -14
((2*(3-4))*5) = -10
(2*((3-4)*5)) = -10
(((2*3)-4)*5) = 10

Output: [-34, -14, -10, -10, 10]

Credits:
Special thanks to @mithmatt for adding this problem and creating all test cases.

 1 public class Solution {
 2     public List<Integer> diffWaysToCompute(String input) {
 3         List<Integer> ans = new ArrayList<Integer>();
 4         for(int i = 0; i < input.length(); i++){
 5             char c = input.charAt(i);
 6             if(c != ‘+‘ && c != ‘-‘ && c != ‘*‘) continue;
 7             List<Integer> left = diffWaysToCompute(input.substring(0,i));
 8             List<Integer> right = diffWaysToCompute(input.substring(i+1,input.length()));
 9             for(int le : left){
10                 for(int ri : right){
11                     if(c == ‘+‘) ans.add(le+ri);
12                     else if(c == ‘-‘) ans.add(le-ri);
13                     else if(c == ‘*‘) ans.add(le*ri);
14                 }
15             }
16         }
17         if(ans.size() == 0) ans.add(Integer.parseInt(input));
18         return ans;
19     }
20 }

使用分治的思想。

时间: 2024-10-10 07:18:35

241. Different Ways to Add Parentheses java solutions的相关文章

LeetCode 241. Different Ways to Add Parentheses

241. Different Ways to Add Parentheses Add to List Description Submission Solutions Total Accepted: 38849 Total Submissions: 92740 Difficulty: Medium Contributors: Admin Given a string of numbers and operators, return all possible results from comput

241. Different Ways to Add Parentheses

241. Different Ways to Add Parentheses https://leetcode.com/problems/different-ways-to-add-parentheses/ 思路就是:首先找到以运算符为根节点,分别计算左子串和右子串的所有结果的集合,然后依次进行组合计算.参考博客http://www.cnblogs.com/ganganloveu/p/4681439.html. 自己的思路错了,直接用两边只用了一个整数去接收左右子串的计算值!! #include

96. Unique Binary Search Trees &amp;&amp; 95. Unique Binary Search Trees II &amp;&amp; 241. Different Ways to Add Parentheses

96. Unique Binary Search Trees Given n, how many structurally unique BST's (binary search trees) that store values 1...n? For example,Given n = 3, there are a total of 5 unique BST's. 1 3 3 2 1 \ / / / \ 3 2 1 1 3 2 / / \ 2 1 2 3 Tree Dynamic Program

[leedcode 241] Different Ways to Add Parentheses

Given a string of numbers and operators, return all possible results from computing all the different possible ways to group numbers and operators. The valid operators are +,- and *. Example 1 Input: "2-1-1". ((2-1)-1) = 0 (2-(1-1)) = 2 Output: 

&lt;LeetCode OJ&gt; 241. Different Ways to Add Parentheses

Total Accepted: 23674 Total Submissions: 65569 Difficulty: Medium Given a string of numbers and operators, return all possible results from computing all the different possible ways to group numbers and operators. The valid operators are+, - and *. E

(medium)LeetCode 241.Different Ways to Add Parentheses

Given a string of numbers and operators, return all possible results from computing all the different possible ways to group numbers and operators. The valid operators are+, - and *. Example 1 Input: "2-1-1". ((2-1)-1) = 0 (2-(1-1)) = 2 Output: 

【LeetCode】241. Different Ways to Add Parentheses

题目: Given a string of numbers and operators, return all possible results from computing all the different possible ways to group numbers and operators. The valid operators are +, - and *. Example 1 Input: "2-1-1" ((2-1)-1) = 0 (2-(1-1)) = 2 Outp

leetcode 241. Different Ways to Add Parentheses (Python版)

题目: Given a string of numbers and operators, return all possible results from computing all the different possible ways to group numbers and operators. The valid operators are+, - and *. 大意是给定一个运算,求解所有运算序列的解 例如 Input: "2*3-4*5" (2*(3-(4*5))) = -

leetcode_241——Different Ways to Add Parentheses (递归,动态规划)

Different Ways to Add Parentheses Total Accepted: 1708 Total Submissions: 6304My Submissions Question Solution Given a string of numbers and operators, return all possible results from computing all the different possible ways to group numbers and op