leetcode 473 用火柴棍组成正方形

题目:
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:
The length sum of the given matchsticks is in the range of 0 to 10^9.
The length of the given matchstick array will not exceed 15.
题解:
深度优先搜索:
class Solution:
def makesquare(self, nums):
“”"
:type nums: List[int]
:rtype: bool
“”"
if not nums:
return False
L,s,sums=len(nums),sum(nums),[0]4
possible_side=s//4
if possible_side
4!=s:return False
nums.sort(reverse=True)
def dfs(index):
if index==L:return sums[0]==sums[1]==sums[2]==possible_side
for i in range(4):
if sums[i]+nums[index]<=possible_side:
sums[i]+=nums[index]
if dfs(index+1):return True
sums[i]-=nums[index]
return False
return dfs(0)

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值