求斐波那契数列的第 n项。
class Solution {
public:
int Fibonacci(int n) {
if(n==0 ) return 0;
if(n==1) return 1;
return Fibonacci(n-1)+Fibonacci(n-2);
}
int main()
{
int n;
cin>>n;
cout<<Fibonacci(n)<<endl;
}
};
替换空格
class Solution {
public:
string replaceSpaces(string &str) {
string res;
for(auto c :str)
if( c==' ') res+="%20";
else res+=c;
return res;
}
};
class Solution {
public:
int getSum(int n) {
int res=n;
n>0 && (res+=getSum(n-1));//利用短路运算终止递归
return res;
//return ((n>0) && (res += getSum(n-1)), res);
}
};
/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode(int x) : val(x), next(NULL) {}
* };
*/
class Solution {
public:
void deleteNode(ListNode* node) {
node->val=node->next->val;// 将值复制给下一个节点
node->next=node->next->next;//删除下一个节点
}
};