C++ (Cpp) Solution::climbStairs Examples

Example #1

File: solution.cpp Project: zlsun/leetcode

int main() {
    Solution s;
    ASSERT s.climbStairs(1) == 1;
    ASSERT s.climbStairs(2) == 2;
    ASSERT s.climbStairs(3) == 3;
    return 0;
}

Example #2

File: 70_climbingStairs.cpp Project: RongLi1986/Algorithms

int main(){
	Solution s;
	cout<<s.climbStairs(1)<<endl;  //1
	cout<<s.climbStairs(2)<<endl;  //2
	cout<<s.climbStairs(3)<<endl;  //3
	cout<<s.climbStairs(4)<<endl;  //5
	cout<<s.climbStairs(5)<<endl;  //8
	cout<<s.climbStairs(44)<<endl;  //
	return 0;
}

Example #3

File: climbStairs.cpp Project: nkhuyu/Leetcode

int main()
{

    Solution sol;
    cout<<sol.climbStairs(1)<<endl;
    cout<<sol.climbStairs(2)<<endl;
    cout<<sol.climbStairs(30)<<endl;

 return 0;
}

Example #4

File: 70.cpp Project: strangemk2/oj

int main()
{
	Solution so;
	cout << so.climbStairs(1) << endl;
	cout << so.climbStairs(2) << endl;
	cout << so.climbStairs(3) << endl;
	cout << so.climbStairs(4) << endl;
	cout << so.climbStairs(10) << endl;
	cout << so.climbStairs(30) << endl;
}

Example #5

File: climbing-stairs.cpp Project: wenpincui/leetcode

int main(int argc, char **argv)
{
    Solution sol;

//    printf("possibility %d\n", sol.possibility(3, 5));
    printf("ret %d\n", sol.climbStairs(44));
}

Example #6

File: Climbing Stairs__dp.cpp Project: wangzhe330/leetcode

void main()
{
	Solution mySolu;
	int num = 0;
	while(cin >> num)
		cout << mySolu.climbStairs(num) << endl; 
}

Example #7

File: Climbing_Stairs.cpp Project: busz/my_leetcode

int main()
{
    Solution test = Solution();
    int n = 10;
    cout<<test.climbStairs(n)<<endl;

}

Example #8

File: leet70_climbingStairs.cpp Project: jfan04/Leetcode-C--solution

int main(){
    Solution solution;
    int ret=solution.climbStairs(40);
    cout<<"Result:"<<ret<<endl;
    system("pause");
    return 0;
}   

Example #9

File: 70climbingStairs.cpp Project: chenruichou/randomThoughts

int main(int argc, char *argv[]){
    Solution sol;
    int n=atoi(argv[1]);
    int out = sol.climbStairs(n);
    cout << out << endl;
    return 1;
}

Example #10

File: ClimbingStairs.cpp Project: silentsongs/leetcode

int main()
{
	Solution* so = new Solution();
	for (int i = 1; i < 11; i++)
	{
		cout<<"input: " << i << ", output: " << so->climbStairs(i) << endl;
	}
}

Example #11

File: ClimbingStairs_sol1.cpp Project: YosenChen/CodePractice

int main(void)
{
    Solution sln;
    printf("sln.climbStairs(4) = %d\n", sln.climbStairs(4));
    printf("sln.climbStairs(5) = %d\n", sln.climbStairs(5));
    getchar();
    return 0;
}

Example #12

File: Climbing_Stairs.cpp Project: sanus912/leetcode-solutions

int main() { 

    Solution mySol;

    for( int i = 0; i < 40; i++)
        cout << " Climb Stairs " << i << " has methods  : " << mySol.climbStairs(i) << endl;

    return 0; 
}

Example #13

File: Climbing Stairs.cpp Project: Honlan/leetcode-c-plus-plus

int main() {
    int n = 2;
	Solution sol;

	// 检查结果是否正确
    cout << sol.climbStairs(n) << endl;

	return 0;
}

Example #14

File: Climbing Stairs.cpp Project: lujcmss/leetcode

int main() {
    int n = 10;
    
    Solution so;
    int ans = so.climbStairs(n);
    
    cout << ans << endl;
    
    return 0;
}

Example #15

File: stairs.cpp Project: yuchaozh/LeetCode

int main(int argc, char* argv[])
{
	int step;
	cout<<"Please input the step: "<<endl;
	cin>>step;
	Solution sol;
	int result = 0;
	result = sol.climbStairs(step);
	cout<<result<<endl;
}

Example #16

File: main.cpp Project: thuzhf/leet-code

int main()
{
	Solution sol;
	int n;
	cin >> n;
	int r = sol.climbStairs(n);
	cout << r << endl;

	return 0;
}

Example #17

File: Climbing_Stairs.cpp Project: zyx4843/leetcode

int _tmain(int argc, _TCHAR* argv[])
{
	int n = 5;
	if ( argc > 1) {
		n = _wtoi(argv[1]);
	}

	Solution so;
	int way = so.climbStairs(n);
	return 0;
}

Example #18

File: climbingStairs.cpp Project: jamesjiongsi/leetcode

int main()
{
    Solution solution;

    for( int index = 0; index <= 20; index ++ )
    {
	    cout << index << " : " << solution.climbStairs( index ) << endl;
    }

    return 0;
}	

Example #19

File: climbing-stairs.cpp Project: AlvinTech/LeetCode

int main(int argc, char const *argv[])
{
	Solution s;
	int result = s.climbStairs(44);
	//1,1,1,1
	//1,1,2
	//1,2,1
	//2,1,1
	//2,2
	//1134903170
	printf("%d\n",result );
	return 0;
}

Example #20

File: ClimbingStairs.cpp Project: alvas/ms_interview_100

int main()
{
    Solution sln;
    const int N = 20;

    for (int i = 0; i < N; ++i)
    {
        std::cout << "i: " << i << " ,";
        int a = sln.climbStairs(i);
        int b = sln.climbStairs2(i);
        std::cout << a << ", " << b << endl;
        assert(a == b);
    }

    return 0;
}

Example #21

File: ClimbingStairs.cpp Project: Raynxxx/LeetCode

int main() {
    Solution solution;
    auto ret = solution.climbStairs(0);
    assert(ret == 0);
    ret = solution.climbStairs(1);
    assert(ret == 1);
    ret = solution.climbStairs(2);
    assert(ret == 2);
    ret = solution.climbStairs(3);
    assert(ret == 3);
    ret = solution.climbStairs(4);
    assert(ret == 5);
    ret = solution.climbStairs(5);
    assert(ret == 8);
    ret = solution.climbStairs(10);
    assert(ret == 89);
    ret = solution.climbStairs(30);
    assert(ret == 1346269);
    return 0;
}

Example #22

File: climbing_stairs.cpp Project: vancexu/LeetCode

int main() {
    Solution sol;
    cout << sol.climbStairs(3);
    cout << endl;
}

Example #23

File: 70. Climbing Stairs.cpp Project: ckl1202/leetcode_ckl

int main(){
    Solution s;
    cout << s.climbStairs(3);
    return 0;
}

Example #24

File: climbStairs.cpp Project: dheerajkhatri/bajinga

int main(){
	Solution obj;
	for(int i=0;i<10;i++)
		cout<<obj.climbStairs(i)<<endl;
	return 0;
}

Example #25

File: Climbing_Stairs.cpp Project: YanliSai/LeetCode-1

int main() {
    Solution s; 
    for(int n : {0,1,2,3,4,5,6,7})
        cout<<s.climbStairs(n)<<endl;
    return 0;
}

Example #26

File: solution070.cpp Project: cpselvis/leetcode

int main(int argc, char **argv)
{
  Solution s;
  cout << s.climbStairs(2) << endl;
  cout << s.climbStairs(5) << endl;
}

Example #27

File: solution.cpp Project: chengui/1337c0d3

int main()
{
    int n = 4;
    Solution s = Solution();
    cout << s.climbStairs(n) << endl;
}

Example #28

File: Climbing Stairs.cpp Project: starsdeep/leetcode_exercise

int main(){
	Solution s = Solution();
	cout << s.climbStairs(3);
}

Example #29

File: 070_Climbing_Stairs.cpp Project: FanZhitao/LeetCode

void main()
{
	Solution s;
	cout << s.climbStairs(100) << endl;
}

Example #30

File: ClimbingStairs.cpp Project: sheepjian/algo_house

int main(int argc, char** argv) {
	Solution sol;
	cout<<"there are "<<sol.climbStairs(stoi(argv[1]))<<" ways\n";
	return 0;
}