## LeetCode 322. Coin Change

 12345 #define min(a,b) (((a) > (b)) ? (b) : (a)) int cmpfunc (const void * a, const void * b) {     return ( *(int*)a - *(int*)b ); } int coinChange(in[......]

Read more

## LeetCode 133. Clone Graph

 123456789 static auto x = []() {     ios::sync_with_stdio(false);     cin.tie(nullptr);     return 0; }(); /**  * Definition for undirected graph.  *[......]

Read more

## LeetCode 457. Circular Array Loop

 12345 bool circularArrayLoop(int* nums, int numsSize) {     int* flag=(int*)calloc(numsSize, sizeof(int));     int t=1;         for(int i=0;i0)?true:[......]

Read more

## LeetCode 958. Check Completeness of a Binary Tree

 12345678 static auto x = []() {     ios::sync_with_stdio(false);     cin.tie(nullptr);     return 0; }(); /**  * Definition for a binary tree node.[......]

Read more

## LeetCode 787. Cheapest Flights Within K Stops

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

Read more

## LeetCode 799. Champagne Tower

 123 double champagneTower(int poured, int query_row, int query_glass) {     double ret[query_row+1][query_row+1];     for(int i=0;i[......]

Read more

## LeetCode 822. Card Flipping Game

 123 int flipgame(int* fronts, int frontsSize, int* backs, int backsSize) {     int* dp=(int*)calloc(2001, sizeof(int));     for(int i=0;i[......]

Read more

## LeetCode 853. Car Fleet

 123456 void quicksort(int* a,double* b,int start,int end){     int mid=start;     int endIndex=end;         for(int i=start+1;istart+1){         qu[......]

Read more

## LeetCode 605. Can Place Flowers

 12345 bool canPlaceFlowers(int* flowerbed, int flowerbedSize, int n) {     if(n==0)return true;         int count=0;     bool leftSpace=true;[......]

Read more