这是一道关于利用给定长度的火柴棒拼成一个正方形的问题。题目要求不能折断火柴，每根必须用一次。输入是火柴棒的长度数组，输出是能否拼成正方形的布尔值。例如，输入[1,1,2,2,2]时，可以拼成边长为2的正方形，因此输出为true；而输入[3,3,3,3,4]时，无法拼成正方形，输出为false。注意，火柴棒长度之和在0到10^9之间，数组长度不超过15。"
80738291,6994092,神经网络搭建与优化实战,"['神经网络', '深度学习', '模型优化', '损失函数', '正则化']
Matchsticks to Square
Rememberthe story of Little Match Girl? By now, you know exactly what matchsticks thelittle match girl has, please find out a way you can make one square by usingup all those matchsticks. You should not break any stick, but you can link themup, and each matchstick must be used exactly one time.
Yourinput will be several matchsticks the girl has, represented with their sticklength. Your output will either be true or false, to represent whether you cansave this little girl or not.
Example1:
Input:[1,1,2,2,2]
Output:true
<
最低0.47元/天 解锁文章
扫一扫
1467
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
