2.4 KiB
2.4 KiB
id | challengeType | title | videoUrl | localeTitle |
---|---|---|---|---|
5900f3a21000cf542c50feb5 | 5 | Problem 54: Poker hands | 问题54:扑克手 |
Description
手牌1球员2冠军1 5H 5C 6S 7S KDPair of Fives 2C 3S 8S 8D TDPair of Eights Player 2 2 5D 8C 9S JS ACHighest card Ace 2C 5C 7D 8S QHHighest card Queen Player 1 3 2D 9C AS AH ACThree Aces 3D 6D 7D TD QDFlush与钻石玩家2 4 4D 6S 9H QH QCPair of Queens最高卡九3D 6D 7H QD QSPair皇后最高卡七人玩家1 5 2H 2D 4C 4D 4SFull HouseWith Three Fours 3C 3D 3S 9S 9DFull Housewith Three Threes Player 1
文件poker.txt包含一千个随机发给两个玩家的牌。该文件的每一行包含十张牌(由一个空格分隔):前五张是Player 1的牌,后五张是Player 2的牌。你可以假设所有的牌都是有效的(没有无效的角色或重复的牌),每个牌手的牌都没有特定的顺序,而且每手牌都有明显的赢家。玩家1赢了多少手牌?
Instructions
Tests
tests:
- text: <code>euler54()</code>应该返回376。
testString: 'assert.strictEqual(euler54(), 376, "<code>euler54()</code> should return 376.");'
Challenge Seed
function euler54() {
// Good luck!
return true;
}
euler54();
Solution
// solution required