Pseudo code: , , int nums int target 1; for (int i 1; i is greater than or equal to 0; i) if ((i + numsi) is greater than or equal to target) target i; return target 0; Time complexity: O(n) Space complexity: O(1) Github: Leetcode:
0
0
Related videos
Preparing
To view the site materials you should be more than or equal to 18 years old