摘要： #include "stdafx.h"#include "XQTools.h"#include <iostream>#include <string>#include <time.h>using namespace std; map<string,string> XQTools::mapTabDat 阅读全文

摘要： bool vis[3][10][10]; bool SetNum(int k,int i,int j){ k-='0'; if(vis[0][i][k]||vis[1][j][k]||vis[2][i/3*3+j/3][k])return false; else{ vis[0][i][k] = tr 阅读全文

摘要： /** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * ListNode(int x) : val(x), next(NULL) {} * }; */class Solut 阅读全文

摘要： #include<stdio.h>#include<iostream>#include<math.h>using namespace std; const double EPS = 1e-6; int sign(double d){ return d < -EPS? -1 :(d > EPS? 1 阅读全文

摘要： // T01051.cpp : Defines the entry point for the console application.// #include "stdafx.h"#include <stdarg.h>#include <iostream> #include <Windows.h># 阅读全文

摘要： #include <Windows.h>#include <TlHelp32.h>#include <iostream> #define DbgOut(x) OutputDebugStringA(x)typedef signed char int8_t;typedef short int16_t;t 阅读全文

摘要： #include "stdafx.h"#include <stdarg.h>#include <iostream>using namespace std; static inline void hlogv(const char *format, va_list args){ char message 阅读全文

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

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

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