LeetCode
ZhanCF
非宁静无以致远
展开
-
LeetCode__Add Dights
Given a non-negative integer num, repeatedly add all its digits until the result has only one digit.For example:Given num = 38, the process is like: 3 + 8 = 11, 1 + 1 = 2. Since 2 has only one digit, r原创 2016-03-10 19:29:55 · 517 阅读 · 0 评论 -
LeetCode__Nim Game
You are playing the following Nim Game with your friend: There is a heap of stones on the table, each time one of you take turns to remove 1 to 3 stones. The one who removes the last stone will be the原创 2016-03-10 19:32:47 · 468 阅读 · 0 评论