大佬教程收集整理的这篇文章主要介绍了[Swift]LeetCode473. 火柴拼正方形 | 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] 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,4] Output: false Explanation: You cAnnot find a way to form a square with all the matchsticks.
Note:
0
to 10^9
.15
.还记得童话《卖火柴的小女孩》吗?现在,你知道小女孩有多少根火柴,请找出一种能使用所有火柴拼成一个正方形的方法。不能折断火柴,可以把火柴连接起来,并且每根火柴都要用到。
输入为小女孩拥有火柴的数目,每根火柴用其长度表示。输出即为是否能用所有的火柴拼成正方形。
示例 1:
输入: [1,2] 输出: true 解释: 能拼成一个边长为2的正方形,每边两根火柴。
示例 2:
输入: [3,4] 输出: false 解释: 不能用所有火柴拼成一个正方形。
注意:
0
到 10^9
之间。1 class Solution { 2 func makesquare(_ nums: [Int]) -> Bool { 3 if nums.isEmpty || nums.count < 4 {return false} 4 var sum:Int = nums.reduce(0,+) 5 if sum % 4 != 0 {return false} 6 var n:Int = nums.count 7 var all:Int = (1 << n) - 1 8 var target:Int = sum / 4 9 var masks:[Int] = [Int]() 10 var validHalf:[Bool] = [Bool](repeaTing:false,count:1 << n) 11 for i in 0...all 12 { 13 var cursum:Int = 0 14 for j in 0...15 15 { 16 if ((i >> j) & 1) == 1 17 { 18 cursum += nums[j] 19 } 20 } 21 if cursum == target 22 { 23 for mask in masks 24 { 25 if (mask & i) != 0 {conTinue} 26 var half:Int = mask | i 27 validHalf[half] = true 28 if validHalf[all ^ half] {return true} 29 } 30 masks.append(i) 31 } 32 } 33 return false 34 } 35 }
1 class Solution { 2 func makesquare(_ nums: [Int]) -> Bool { 3 guard nums.count >= 4 else { return false } 4 let sum = nums.reduce(0,{ $0 + $1 }) 5 if sum % 4 != 0 { 6 return false 7 } 8 var sides: [Int] = Array(repeaTing: 0,count: 4) 9 return dfs(nums.sorted(by: >),0,&sides,sum / 4) 10 } 11 12 func dfs(_ nums: [Int],_ index: Int,_ sides: inout [Int],_ target: int) -> Bool { 13 if index == nums.count { 14 return sides[0] == sides[1] && sides[0] == sides[2] && sides[0] == sides[3] && sides[0] == target 15 } 16 17 for i in 0 ..< sides.count { 18 if sides[i] + nums[index] > target { 19 conTinue 20 } 21 sides[i] += nums[index] 22 if dfs(nums,index + 1,&sides,target) { 23 return true 24 } 25 sides[i] -= nums[index] 26 } 27 return false 28 } 29 }
以上是大佬教程为你收集整理的[Swift]LeetCode473. 火柴拼正方形 | Matchsticks to Square全部内容,希望文章能够帮你解决[Swift]LeetCode473. 火柴拼正方形 | Matchsticks to Square所遇到的程序开发问题。
如果觉得大佬教程网站内容还不错,欢迎将大佬教程推荐给程序员好友。
本图文内容来源于网友网络收集整理提供,作为学习参考使用,版权属于原作者。
如您有任何意见或建议可联系处理。小编QQ:384754419,请注明来意。