Longest Common Prefix
Write a function to find the longest common prefix string amongst an array of strings.
If there is no common prefix, return an empty string “”.
Write a function to find the longest common prefix string amongst an array of strings.
If there is no common prefix, return an empty string “”.
Roman numerals are represented by seven different symbols: I, V, X, L, C, D and M.
Given an integer x, return true if x is palindrome integer.
An integer is a palindrome when it reads the same backward as forward.
将String类型的sring1转换为CSting类型的cstring1
1 | CStringA str; |
在MFC框架下将CInfoDlg界面挂载到主页面
1 | Context.m_pNewViewClass = RUNTIME_CLASS(CInfoDlg); |