【LeetCode】Climbing Stairs

class Solution {
public:
    int climbStairs(int n) {
    int prev, curr;
	prev = 0; curr = 1;
	for (int i = 0; i < n; i++)
	{
		int temp = curr;
		curr += prev;
		prev = temp;
	}
	return curr;
    }
};