556. Next Greater Element III
Read the full problem statement on LeetCode.
Difficulty: medium Acceptance: 35% Topics: Math, Two Pointers, String
View full problem on LeetCode Reading material
Reference solution (spoiler · python)
# Time: O(logn) = O(1)
# Space: O(logn) = O(1)
class Solution(object):
def nextGreaterElement(self, n):
"""
:type n: int
:rtype: int
"""
digits = map(int, list(str(n)))
k, l = -1, 0
for i in xrange(len(digits) - 1):
if digits[i] < digits[i + 1]:
k = i
if k == -1:
digits.reverse()
return -1
for i in xrange(k + 1, len(digits)):
if digits[i] > digits[k]:
l = i
digits[k], digits[l] = digits[l], digits[k]
digits[k + 1:] = digits[:k:-1]
result = int("".join(map(str, digits)))
return -1 if result >= 0x7FFFFFFF else result
Solution from kamyu104/LeetCode-Solutions · MIT