LC-2296 Hard LeetCode

2296. Design a Text Editor

Linked List String Stack Design Simulation Doubly-Linked List

Read the full problem statement on LeetCode.

Difficulty: hard Acceptance: 47% Topics: Linked List, String, Stack, Design, Simulation, Doubly-Linked List

Reading material

Linked Lists 14 min Strings 12 min Stacks & Queues 11 min

Reference solution (spoiler · python)

# Time:  ctor:        O(1)
#        addText:     O(l)
#        deleteText:  O(k)
#        cursorLeft:  O(k)
#        cursorRight: O(k)
# Space: O(n)

# design, stack
class TextEditor(object):

    def __init__(self):
        self.__LAST_COUNT = 10
        self.__left = []
        self.__right = []

    def addText(self, text):
        """
        :type text: str
        :rtype: None
        """
        for x in text:
            self.__left.append(x)

    def deleteText(self, k):
        """
        :type k: int
        :rtype: int
        """
        return self.__move(k, self.__left, None)

    def cursorLeft(self, k):
        """
        :type k: int
        :rtype: str
        """
        self.__move(k, self.__left, self.__right)
        return self.__last_characters()

    def cursorRight(self, k):
        """
        :type k: int
        :rtype: str
        """
        self.__move(k, self.__right, self.__left)
        return self.__last_characters()

    def __move(self, k, src, dst):
        cnt = min(k, len(src))
        for _ in xrange(cnt):
            if dst is not None:
                dst.append(src[-1])
            src.pop()
        return cnt

    def __last_characters(self):
        return "".join(self.__left[-self.__LAST_COUNT:])

Solution from kamyu104/LeetCode-Solutions · MIT