2620. Counter
Easy
482
26

Given an integer n, return a counter function. This counter function initially returns n and then returns 1 more than the previous value every subsequent time it is called (n, n + 1, n + 2, etc).

 

Example 1:

Input: 
n = 10 
["call","call","call"]
Output: [10,11,12]
Explanation: 
counter() = 10 // The first time counter() is called, it returns n.
counter() = 11 // Returns 1 more than the previous time.
counter() = 12 // Returns 1 more than the previous time.

Example 2:

Input: 
n = -2
["call","call","call","call","call"]
Output: [-2,-1,0,1,2]
Explanation: counter() initially returns -2. Then increases after each sebsequent call.

 

Constraints:

  • -1000 <= n <= 1000
  • At most 1000 calls to counter() will be made
Accepted
59.4K
Submissions
69.3K
Acceptance Rate
85.7%

Seen this question in a real interview before?
1/4
Yes
No

Discussion (0)
Copyright ©️ 2023 LeetCode All rights reserved