leetcode 241 solution

Leetcode_241.java

@@ -0,0 +1,63 @@
+class Solution {
+
+    public List<Integer> diffWaysToCompute(String expression) {
+        List<Integer> results = new ArrayList<>();
+
+        // Base case: if the string is empty, return an empty list
+        if (expression.length() == 0) return results;
+
+        // Base case: if the string is a single character, treat it as a number and return it
+        if (expression.length() == 1) {
+            results.add(Integer.parseInt(expression));
+            return results;
+        }
+
+        // If the string has only two characters and the first character is a digit, parse it as a number
+        if (
+            expression.length() == 2 && Character.isDigit(expression.charAt(0))
+        ) {
+            results.add(Integer.parseInt(expression));
+            return results;
+        }
+
+        // Recursive case: iterate through each character
+        for (int i = 0; i < expression.length(); i++) {
+            char currentChar = expression.charAt(i);
+
+            // Skip if the current character is a digit
+            if (Character.isDigit(currentChar)) continue;
+
+            // Split the expression into left and right parts
+            List<Integer> leftResults = diffWaysToCompute(
+                expression.substring(0, i)
+            );
+            List<Integer> rightResults = diffWaysToCompute(
+                expression.substring(i + 1)
+            );
+
+            // Combine results from left and right parts
+            for (int leftValue : leftResults) {
+                for (int rightValue : rightResults) {
+                    int computedResult = 0;
+
+                    // Perform the operation based on the current character
+                    switch (currentChar) {
+                        case '+':
+                            computedResult = leftValue + rightValue;
+                            break;
+                        case '-':
+                            computedResult = leftValue - rightValue;
+                            break;
+                        case '*':
+                            computedResult = leftValue * rightValue;
+                            break;
+                    }
+
+                    results.add(computedResult);
+                }
+            }
+        }
+
+        return results;
+    }
+}