摘要
针对Google Code Jam编程大赛的PlayCards问题,提出了PlayCards问题的新算法,并对该算法进行了深入的研究,一定程度上减少了在深入递归时的时间消耗。
This paper presents a new algorithm regarding to the PlayCards problem which is involved in Google Code Jam. Moreover, art advanced research is committed to it which in some degree decreases the time expenditure on recursion.
出处
《计算机与现代化》
2009年第2期132-134,共3页
Computer and Modernization
关键词
纸牌游戏
最优算法
PlayCards
optimal algorithm
