摘要： http://blog.csdn.net/very_2/article/details/6534915 #ifdef __cplusplusextern "C" {#endif _declspec (dllexport) int add(int a, char b) { return a + b; 阅读全文

摘要： https://jingyan.baidu.com/article/b7001fe199dbf00e7382dd75.html 阅读全文

摘要： // GameCapture.cpp : 定义控制台应用程序的入口点。//#include <Windows.h>#include "stdafx.h"#include "game-capture.h"#include <TlHelp32.h>#include <iostream>using nam 阅读全文

摘要： class Solution {public: vector<vector<int>> threeSum(vector<int>& nums) { int len = nums.size(); vector<vector<int>> ans; sort(nums.begin(), nums.end( 阅读全文

摘要： char* longestCommonPrefix(char** strs, int strsSize) { if(strsSize == 0)return ""; for(int i = 0 ; strs[0][i] ; i ++){ for(int j = 1 ; j < strsSize ; 阅读全文

摘要： class Solution {private: static int a[200]; static map<int,string> mp; static vector<int> vec_list; void init (){ if(a['I'])return ; a[0] = 0; a['I'] 阅读全文

摘要： int a[200]; int romanToInt(char* s) { int num = 0; a[0] = 0; a['I'] = 1; a['X'] = 10; a['C'] = 100; a['M'] = 1000; a['V'] = 5; a['L'] = 50; a['D'] = 5 阅读全文

摘要： int maxArea(int* h, int heightSize) { int left = 0; int right = 0; int lp = 0; int ans = 0; int rp = heightSize -1; while(lp < rp) { if(h[lp] < h[rp]) 阅读全文

摘要： int myAtoi(char* str) { long long ans = 0; int flag = 1; int be = 0; while(str[be]==' ')be++; if(str[be]=='-') { flag = -1; be++; }else if(str[be] == 阅读全文

摘要： bool isMatch(char* s, char* p) { if(s[0] == 0) { if(p[0] == 0)return true; if(p[0] != 0 && p[1] == '*')return isMatch(s,p+2); return false; } if(p[0] 阅读全文