zoukankan      html  css  js  c++  java
  • 473. Matchsticks to Square

    Remember the story of Little Match Girl? By now, you know exactly what matchsticks the little match girl has, please find out a way you can make one square by using up all those matchsticks. You should not break any stick, but you can link them up, and each matchstick must be used exactly one time.

    Your input will be several matchsticks the girl has, represented with their stick length. Your output will either be true or false, to represent whether you could make one square using all the matchsticks the little match girl has.

    Example 1:

    Input: [1,1,2,2,2]
    Output: true
    
    Explanation: You can form a square with length 2, one side of the square came two sticks with length 1.
    

    Example 2:

    Input: [3,3,3,3,4]
    Output: false
    
    Explanation: You cannot find a way to form a square with all the matchsticks.

    Note:

    1. The length sum of the given matchsticks is in the range of 0 to 10^9.
    2. The length of the given matchstick array will not exceed 15.

    Approach #1: DFS. [Java]

    class Solution {
        public boolean makesquare(int[] nums) {
            if (nums == null || nums.length < 4) return false;
            
            int sum = 0;
            for (int num : nums) 
                sum += num;
            if (sum % 4 != 0) return false;
            int side = sum / 4;
            
            int[] sides = {0, 0, 0, 0};
            
            Arrays.sort(nums);
            reverse(nums);
            
            return dfs(sides, nums, 0, side);
        }
        
        public boolean dfs(int[] sides, int[] nums, int index, int side) {
            if (index == nums.length) {
                if (sides[0] == side && sides[1] == side && sides[2] == side)
                    return true;
                return false;
            }
            for (int i = 0; i < 4; ++i) {
                if (sides[i] + nums[index] > side) continue;
                sides[i] += nums[index];
                if (dfs(sides, nums, index+1, side)) return true;
                sides[i] -= nums[index];
            }
            return false;
        }
        
        public void reverse(int[] nums) {
            int l = 0, r = nums.length - 1;
            while (l < r) {
                int temp = nums[l];
                nums[l] = nums[r];
                nums[r] = temp;
                l++;
                r--;
            }
        }
    }
    

      

    Analysis:

    Every matchstack can belong to either of the 4 sides. We don't which one. Maybe try out every options.

    Reference:

    https://leetcode.com/problems/matchsticks-to-square/discuss/95729/Java-DFS-Solution-with-Explanation

    永远渴望,大智若愚(stay hungry, stay foolish)
  • 相关阅读:
    [AH2017/HNOI2017]礼物
    [八省联考2018]林克卡特树lct
    [洛谷P4847]银河英雄传说V2
    [洛谷P4999]烦人的数学作业
    [洛谷P4171][JSOI2010]满汉全席
    [CF785E]Anton and Permutation
    [洛谷P2511][HAOI2008]木棍分割
    [洛谷P4430]小猴打架
    [UVA307]小木棍 Sticks
    [LOJ #6433]「PKUSC2018」最大前缀和
  • 原文地址:https://www.cnblogs.com/h-hkai/p/10952455.html
Copyright © 2011-2022 走看看