2017 年 9月 1 日随笔档案 - 英雄与侠义的化身

70. Climbing Stairs(easy, 号称 Dynamic Programming 天下第一题)

摘要： You are climbing a stair case. It takes n steps to reach to the top. Each time you can either climb 1 or 2 steps. In how many distinct ways can you cl 阅读全文

posted @ 2017-09-01 11:46 英雄与侠义的化身阅读(124) 评论(0) 推荐(0)

63. Unique Paths II(中等, 能独立做出来的DP类第二个题^^)

摘要： Follow up for "Unique Paths": Now consider if some obstacles are added to the grids. How many unique paths would there be? An obstacle and empty space 阅读全文

posted @ 2017-09-01 11:15 英雄与侠义的化身阅读(114) 评论(0) 推荐(0)

3.2 2-dim Vector Initialization

摘要：声明３行４列的数组 cpp const int m = 3, n = 4; vector A(m); // 3 rows for(int i = 0; i 阅读全文

posted @ 2017-09-01 09:34 英雄与侠义的化身阅读(226) 评论(0) 推荐(0)

Spurs

公告