## LeetCode 1023. Binary String With Substrings Representing 1 To N

 123456789 static auto x = []() {     ios::sync_with_stdio(false);     cin.tie(nullptr);     return 0; }(); class Solution { public:     bool queryStri[......]

## LeetCode 1021. Best Sightseeing Pair

 1234567 int maxScoreSightseeingPair(int* A, int ASize) {         int lastIpart=0;     int max=INT_MIN;         for(int i=0;imax){                 ma[......]

## MapReduce study

MapReduce is a programming model and an associated implementation for processing and generating big data sets with a parallel, distributed algorithm o[……]

## LeetCode 365. Water and Jug Problem

 123456789 int getGCD(int a,int b){     if(a==0){         return b;     }     if(b==0){         return a;     }     if(a==b)return a;     if(a[......]

## LeetCode 399. Evaluate Division

 123456789 static auto x = []() {     ios::sync_with_stdio(false);     cin.tie(nullptr);     return 0; }(); class GraphNode{ public:     string key;[......]

## LeetCode 192. Word Frequency

GeSHi Error: GeSHi could not find the language shell (using path /home/opc/blog/wp-content/plugins/codecolorer/lib/geshi/) (code 2)

## LeetCode 290. Word Pattern

 123456 class Solution(object):     def wordPattern(self, pattern, str):         map1={}         map2={}         strarr=str.split(' ')         if len(p[......]

## LeetCode 79. Word Search

 123 bool check(char** board,bool** flag,char* w,int row,int col, int boardRowSize, int boardColSize){     if(*w=='\0')return true;     if(row>0){[......]