Day 28 | 93. Restore IP Addresses | 78. Subsets | 90. Subsets II

Day 1 | 704. Binary Search | 27. Remove Element | 35. Search Insert Position | 34. First and Last Position of Element in Sorted Array
Day 2 | 977. Squares of a Sorted Array | 209. Minimum Size Subarray Sum | 59. Spiral Matrix II
Day 3 | 203. Remove Linked List Elements | 707. Design Linked List | 206. Reverse Linked List
Day 4 | 24. Swap Nodes in Pairs| 19. Remove Nth Node From End of List| 160.Intersection of Two Lists
Day 6 | 242. Valid Anagram | 349. Intersection of Two Arrays | 202. Happy Numbe | 1. Two Sum
Day 7 | 454. 4Sum II | 383. Ransom Note | 15. 3Sum | 18. 4Sum
Day 8 | 344. Reverse String | 541. Reverse String II | 替换空格 | 151.Reverse Words in a String | 左旋转字符串
Day 9 | 28. Find the Index of the First Occurrence in a String | 459. Repeated Substring Pattern
Day 10 | 232. Implement Queue using Stacks | 225. Implement Stack using Queue
Day 11 | 20. Valid Parentheses | 1047. Remove All Adjacent Duplicates In String | 150. Evaluate RPN
Day 13 | 239. Sliding Window Maximum | 347. Top K Frequent Elements
Day 14 | 144.Binary Tree Preorder Traversal | 94.Binary Tree Inorder Traversal| 145.Binary Tree Postorder Traversal
Day 15 | 102. Binary Tree Level Order Traversal | 226. Invert Binary Tree | 101. Symmetric Tree
Day 16 | 104.MaximumDepth of BinaryTree| 111.MinimumDepth of BinaryTree| 222.CountComplete TreeNodes
Day 17 | 110. Balanced Binary Tree | 257. Binary Tree Paths | 404. Sum of Left Leaves
Day 18 | 513. Find Bottom Left Tree Value | 112. Path Sum | 105&106. Construct Binary Tree
Day 20 | 654. Maximum Binary Tree | 617. Merge Two Binary Trees | 700.Search in a Binary Search Tree
Day 21 | 530. Minimum Absolute Difference in BST | 501. Find Mode in Binary Search Tree | 236. Lowes
Day 22 | 235. Lowest Common Ancestor of a BST | 701. Insert into a BST | 450. Delete Node in a BST
Day 23 | 669. Trim a BST | 108. Convert Sorted Array to BST | 538. Convert BST to Greater Tree
Day 24 | 77. Combinations
Day 25 | 216. Combination Sum III | 17. Letter Combinations of a Phone Number
Day 27 | 39. Combination Sum | 40. Combination Sum II | 131. Palindrome Partitioning

---

LeetCode 93. Restore IP Addresses

Question Link

class Solution {
    List<String> result = new ArrayList<>();

    public List<String> restoreIpAddresses(String s) {
        backTracking(0, s, 0);
        return result;
    }

    void backTracking(int index, String s, int pointSum){
        if(pointSum == 3){
            if(isValid(s, index, s.length() - 1))
                result.add(s);
            return;
        }
        for(int i = index; i < s.length(); i++){
            if(isValid(s, index, i)){
                s = s.substring(0, i + 1) + '.' + s.substring(i+1); // add the dot
                pointSum++;
                backTracking(i + 2, s, pointSum); // The position of the next substring is i+2 after inserting a dot.
                pointSum--;
                s = s.substring(0, i + 1) + s.substring(i + 2);     // remove the dot
            }else   
                break;
        }
    }

    Boolean isValid(String s, int start, int end) {
        if(start > end)
            return false;
        if(s.charAt(start) == '0' && start < end)
            return false;
        if(Long.parseLong(s.substring(start, end+1)) <= 255)
            return true;
        else
            return false;
    }
}

• The position of the next substring is i+2 after inserting a dot.
• Use the index to record the start position of the following split.
• Use the pointNum to record the number of dots.

LeetCode 78. Subsets

Question Link

class Solution {
    List<List<Integer>> result = new ArrayList<>();
    List<Integer> path = new ArrayList<>();

    public List<List<Integer>> subsets(int[] nums) {
        backTracking(0, nums);
        return result;
    }

    void backTracking(int index, int[] nums){
        result.add(new ArrayList<>(path));
        if(index >= nums.length)
            return;
        
        for(int i = index; i < nums.length; i++){
            path.add(nums[i]);
            backTracking(i + 1, nums);
            path.remove(path.size() - 1);
        }
    }
}

• We should collect the result before the termination condition.

LeetCode 90. Subsets II

Question Link

class Solution {
    List<List<Integer>> result = new ArrayList<>();
    List<Integer> path = new ArrayList<>();
    boolean[] isUsed;

    public List<List<Integer>> subsetsWithDup(int[] nums) {
        Arrays.sort(nums);
        isUsed = new boolean[nums.length];
        backTracking(0, nums);
        return result;
    }

    void backTracking(int index, int[] nums){
        result.add(new ArrayList<>(path));
        if(index >= nums.length)
            return;
        for(int i = index; i < nums.length; i++){
            if(i > 0 && nums[i] == nums[i-1] && isUsed[i-1] == false)
                continue;
            isUsed[i] = true;
            path.add(nums[i]);
            backTracking(i+1, nums);
            path.remove(path.size() - 1);
            isUsed[i] = false;
        }
    }
}