上一页 1 ··· 3 4 5 6 7 8 9 10 11 ··· 17 下一页
摘要: C++类的大小 (i) 如下代码: include using namespace std; class CBase { }; class CDerive :public CBase { }; int main(int argc, char argv[]) { CDerive p[3]; cout 阅读全文
posted @ 2016-09-12 13:16 HorseShoe2016 阅读(185) 评论(0) 推荐(0) 编辑
摘要: C++类的数组中构造函数和析构函数的调用顺序(2) 对于如下的代码: include using namespace std; class CBase { private: static int count; public: int id; public: CBase() { id = CBase: 阅读全文
posted @ 2016-09-12 13:02 HorseShoe2016 阅读(2468) 评论(0) 推荐(0) 编辑
摘要: 基类和派生类:构造函数和析构函数的执行顺序 在Visual Studio中,新建控制台工程,构造类如下: include using namespace std; class CBase { public: CBase() { cout Test.exe CBase():Constructor CD 阅读全文
posted @ 2016-09-12 12:00 HorseShoe2016 阅读(4392) 评论(0) 推荐(0) 编辑
摘要: 在Android Studio中新建了一个 setting.xml 文件,布局好文件后,从 Text 界面切换到 Design 界面,显示了如下错误: 网上搜寻 The graphics preview in the layout editor may not be accurate ,还是没有解决 阅读全文
posted @ 2016-09-07 11:22 HorseShoe2016 阅读(2727) 评论(0) 推荐(0) 编辑
摘要: 395. Longest Substring with At least K Repeating Characters Find the length of the longest substring T of a given string (consists of lowercase letter 阅读全文
posted @ 2016-09-05 22:18 HorseShoe2016 阅读(2838) 评论(1) 推荐(0) 编辑
摘要: 394. Decode String Given an encoded string, return it's decoded string. The encoding rule is: , where the encoded_string inside the square brackets is 阅读全文
posted @ 2016-09-05 22:07 HorseShoe2016 阅读(948) 评论(0) 推荐(0) 编辑
摘要: 393. UTF 8 Validation A character in UTF8 can be from 1 to 4 bytes long, subjected to the following rules: 1. For 1 byte character, the first bit is a 阅读全文
posted @ 2016-09-05 21:52 HorseShoe2016 阅读(662) 评论(0) 推荐(0) 编辑
摘要: 392. Is Subsequence Given a string s and a string t , check if s is subsequence of t . You may assume that there is only lower case English letters in 阅读全文
posted @ 2016-09-05 21:36 HorseShoe2016 阅读(1856) 评论(0) 推荐(0) 编辑
摘要: 5. Longest Palindromic Substring Given a string S, find the longest palindromic substring in S. You may assume that the maximum length of S is 1000, a 阅读全文
posted @ 2016-09-03 20:11 HorseShoe2016 阅读(146) 评论(0) 推荐(0) 编辑
摘要: 391. Perfect Rectangle Given N axis aligned rectangles where N 0, determine if they all together form an exact cover of a rectangular region. Each rec 阅读全文
posted @ 2016-09-01 19:58 HorseShoe2016 阅读(815) 评论(0) 推荐(0) 编辑
上一页 1 ··· 3 4 5 6 7 8 9 10 11 ··· 17 下一页