## LeetCode 905. Sort Array By Parity

 12345 /**  * Return an array of size *returnSize.  * Note: The returned array must be malloced, assume caller calls free().  */ int* sortArrayByParity[......]

## LeetCode 944. Delete Columns to Make Sorted

 1234 int minDeletionSize(char** A, int ASize) {     int colCount=strlen(A[0]);     int ret=0;     for(int i=0;i[......]

## LeetCode 929. Unique Email Addresses

 1234 class Solution {     public int numUniqueEmails(String[] emails) {         HashSet set=new HashSet();         for(String email:emails){[......]

## LeetCode 224. Basic Calculator

 1234567 int calculateHelper(char** t){     int ret=0;     bool isAdd=true;     int num=0;         while(**t!='\0'){         if(**t=='('){[......]

## LeetCode 583. Delete Operation for Two Strings

 12345678 inline int min2(int a,int b){     return a>b?b:a; } inline int min3(int a,int b,int c){     return min2(min2(a,b),c); } int minDistance(char*[......]

## LeetCode 611. Valid Triangle Number

 123456 int cmpfunc (const void * a, const void * b) {    return ( *(int*)a - *(int*)b ); } int triangleNumber(int* nums, int numsSize) {     int count[......]

## LeetCode 392. Is Subsequence

 123456 bool isSubsequence(char* s, char* t) {     char* si=s;     char* ti=t;     while(*si!='\0'&&*ti!='\0'){         if(*si==*ti){             si++;[......]

## LeetCode 357. Count Numbers with Unique Digits

 1234 class Solution { private:     int arr[10]={10,9*9,9*9*8,9*9*8*7,9*9*8*7*6,9*9*8*7*6*5,9*9*8*7*6*5*4,               9*9*8*7*6*5*4*3,9*9*8*7*6*5*4*[......]