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: [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.

只要分别计算运算符左右两个序列的和即可。

public class Solution {
	List<Integer> numbers = new LinkedList<>();
	List<Character> opraters = new ArrayList<>();
    public List<Integer> diffWaysToCompute(String input) {
        StringBuilder num = new StringBuilder();
        for(int i=0;i<input.length();i++){
        	if('0'<=input.charAt(i)&&input.charAt(i)<='9'){
        		num.append(input.charAt(i));
        	}else{
        		numbers.add(Integer.parseInt(num.toString()));
        		opraters.add(input.charAt(i));
        		num = new StringBuilder();
        	}
        }
        numbers.add(Integer.parseInt(num.toString()));
        List<Integer> res = dfs(numbers,opraters);
        Collections.sort(res);
        return res;
    }

    private List<Integer> dfs(List<Integer> numbers,List<Character> opraters){
    	List<Integer> res = new ArrayList<>();
    	if(numbers.size()==1){
    		res.add(numbers.get(0));
    		return res;
    	}/*else if(opraters.size()==1){
    		res.add(opRes(numbers.get(0),numbers.get(1),opraters.get(0)));
    		return res;
    	}*/
    	for(int i=0;i<opraters.size();i++){
    		char c = opraters.get(i);
    		List<Integer> leftRes = dfs(numbers.subList(0, i+1),opraters.subList(0, i));
    		List<Integer> rightRes = dfs(numbers.subList(i+1,numbers.size()),opraters.subList(i+1,opraters.size()));
    		for(int left:leftRes){
    			for(int right:rightRes){
    				res.add(opRes(left,right,c));
    			}
    		}
    	}
    	return res;
    }

    private int opRes(int a,int b,char op){
    	switch(op){
    		case '*' :
    			return a*b;
    		case '+':
    			return a+b;
    	}
    	return a-b;
    }

}

版权声明:本文为博主原创文章,未经博主允许不得转载。

时间: 2024-10-11 00:18:35

Different Ways to Add Parentheses的相关文章

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

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

[LeetCode][JavaScript]Different Ways to Add Parentheses

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". ((

LeetCode -- 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 1Input: "2-1-1". ((2-1)-1) = 0(2-(1-1)) = 2Outpu

[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: 

Different Ways to Add Parentheses——Leetcode

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