Hi, I am wondering the time complexity of sum(nums), I know this solution can be accepted, but the time complexity should be O(n), while the requirement is O(logn). Also, the time and space complexities of set(nums) are also larger than O(logn) and O(1).