Handle the zeros.
\n zeros are so special in this case,\n zeros could make duplicated sum.\n that means all values could repeat at least 2 **(count(0 in nums))\n \n \nremove zero
\n zeros are so special in this case,\n zeros could make duplicated sum.\n that means all values could repeat at least 2 **(count(0 in nums))\n \n \nremove zeros from the array will make it fast when any zero present in the array. while it cost very few if there is no zero\n\nk = (k - 1) // (2 ** iCountOfZeros) + 1\n\n
[]