研究生阶段发现自己动手能力还是很弱,所以用leetcode来练练算法,希望可以提高自己。
下面是按我自己做题的顺序解答(C++):
2016年9月13日00:02:44
344. Reverse String
Write a function that takes a string as input and returns the string reversed.
Example:
Given s = "hello", return "olleh".
class Solution {
public:
string reverseString(string s) {
int n = s.length();
for(int i = 0;i<n/2;i++)
{
char t = s[i];
s[i] = s[n-i-1];
s[n-i-1]=t;
}
return s;
}
};
292. 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 winner. You will take the first turn to remove the stones.
Both of you are very clever and have optimal strategies for the game. Write a function to determine whether you can win the game given the number of stones in the heap.
For example, if there are 4 stones in the heap, then you will never win the game: no matter 1, 2, or 3 stones you remove, the last stone will always be removed by your friend.
Hint:
Show Hint- If there are 5 stones in the heap, could you figure out a way to remove the stones such that you will always be the winner?
class Solution {
public:
bool canWinNim(int n) {
if(n%4==0)
return false;
return true;
}
};