## LeetCode 113. Path Sum II

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

## LeetCode 36. Valid Sudoku

 123 bool isValidSudoku(char** board, int boardSize, int* boardColSize){     bool** rowArr=(bool**)malloc(sizeof(bool*)*9);     for(int i=0;i[......]

## LeetCode 54. Spiral Matrix

 1234 /**  * Note: The returned array must be malloced, assume caller calls free().  */ int* spiralOrder(int** matrix, int matrixSize, int* matrixC[......]

## LeetCode 24. Swap Nodes in Pairs

 12345678910 /**  * Definition for singly-linked list.  * struct ListNode {  *     int val;  *     struct ListNode *next;  * };  */ struct ListNode* s[......]

## LeetCode 50. Pow(x, n)

 1234567 double myPow(double x, int n){     if(n==0)return 1;     else if(n>1));             return 1/(t*t);         }         else{             return[......]

## LeetCode 279. Perfect Squares

 12345 int* arr=NULL; int c=0; int numSquares(int n){     if(n[......]

## LeetCode 19. Remove Nth Node From End of List

 12345678910 /**  * Definition for singly-linked list.  * struct ListNode {  *     int val;  *     struct ListNode *next;  * };  */ struct ListNode* r[......]

## LeetCode 12. Integer to Roman

 123 class Solution {     static final String[] MArr={"","M","MM","MMM"};     static final String[] CArr={"","C","CC","CCC","CD","D","DC","DCC","DCCC",[......]