LeeCode-Single Number II

Given an array of integers, every element appears three times except for one. Find that single one.

 int singleNumber(int* nums, int numsSize)
 {
     if(numsSize==)
         return nums[];
     int i,j,k;
     for(i=;i<numsSize;i++)
     {
         for(j=i-;j>=;j--)
         {
             if(nums[i]>=nums[j])
             {
                 break;
             }
         }

         if(j!=i-)
         {
             int temp=nums[i];
             for(k=i-;k>j;k--)
             {
                 nums[k+]=nums[k];
             }
             nums[k+]=temp;
         }
     }

     if(nums[]!=nums[])
     {
         return nums[];
     }
     else
     {
         for(i=;i<numsSize-;i++)
         {
             if((nums[i]==nums[i+])||(nums[i+]==nums[i+]))
             {
                 continue;
             }
             else
             {
                 return nums[i+];
             }
         }
     }
 }