Tag:Huifen

  • LeetCode 136^56-I

    Time:2021-6-25

    Portal:136:https://leetcode-cn.com/probl…56-I:https://leetcode-cn.com/probl…For the second question, the problem seems simple, but there is a mystery that “the time complexity is O (n), and the space complexity is O (1)”. O (n) is easy to implement, but it is much more complicated with the requirement of space complexity.Consider the case of a single numberThat is, question 136, if […]