1 2 3 4 5 6 | bool **row=NULL; bool **col=NULL; bool ***square=NULL; bool mark(int rowIndex,int colIndex,char** board,bool add){ if(board[rowIndex][[......]<p class="read-more"><a href="https://www.gerrytang.top/?p=897">Read more</a></p> |
LeetCode 164. Maximum Gap
1 2 3 4 5 6 7 8 9 | static auto x = []() { ios::sync_with_stdio(false); cin.tie(nullptr); return 0; }(); class Solution { public: int maximumGap[......]<p class="read-more"><a href="https://www.gerrytang.top/?p=894">Read more</a></p> |
LeetCode 233. Number of Digit One
1 2 3 4 5 6 | int countDigitOne(int n){ int count=0; long unit=10; long unitCount=1; while(n>=unitCount){ int t=n/unit*unitCount;[......]<p class="read-more"><a href="https://www.gerrytang.top/?p=892">Read more</a></p> |
LeetCode 1363. Largest Multiple of Three
1 2 3 4 | char* output(int* arr){ int count=0; for(int i=0;i=0;--i){ for(int j=0;j[......]<p class="read-more"><a href="https://www.gerrytang.top/?p=890">Read more</a></p> |
LeetCode 57. Insert Interval
1 2 3 4 5 6 7 8 9 | static auto x = []() { ios::sync_with_stdio(false); cin.tie(nullptr); return 0; }(); class Solution { public: vector insert([......]<p class="read-more"><a href="https://www.gerrytang.top/?p=888">Read more</a></p> |
LeetCode 42. Trapping Rain Water
1 2 3 4 5 6 7 8 9 | static auto x = []() { ios::sync_with_stdio(false); cin.tie(nullptr); return 0; }(); class Solution { private: vector getHig[......]<p class="read-more"><a href="https://www.gerrytang.top/?p=886">Read more</a></p> |
LeetCode 41. First Missing Positive
1 2 3 4 5 6 7 | void setNum(int* nums,int numsSize,int val){ if(valnumsSize){ return; } else if(nums[val-1]==val){ return; }[......]<p class="read-more"><a href="https://www.gerrytang.top/?p=884">Read more</a></p> |