lichao_normal

摘要： 1 int divide(int dividend, int divisor) { 2 if(divisor==0)return INT_MAX; 3 if(dividend==0)return 0; 4 long long res=0; 5 int flag=1; 6 long long d1=d 阅读全文

摘要： Given a sorted array, remove the duplicates in place such that each element appear only once and return the new length. Do not allocate extra space fo 阅读全文