Xuqingquan0926的博客

LeetCode原题： 485. Max Consecutive Ones Given a binary array, find the maximum number of consecutive 1s in this array. Example 1: Input: [1,1,0,1,1,1] Output: 3 Explanation: The first two

1、先建立一个基于对话框的工程，命名为test 2、在自定义一个类，用于封装全局变量和全局函数，如CPublic，基类随便定义吧，我用的是CDialog 3、在Public.h中Class Public下声明静态全局变量和全局函数，如    class CPublic : public CDialog { // Construction public:  CPublic(CWnd