def generate(n: int) -> list:
 triangle = []

    for i in range(n):
        row = [1] * (i + 1) 
        for j in range(1, i):
            row[j] = triangle[i-1][j-1] + triangle[i-1][j]
        triangle.append(row)

    return triangle

Berilgan belgilar ro'yxatini teskari tartibga keltiring.

Xotira murakkabligi O(1) bo'lsin.

Misol 1:
Kiritish: s = ["h","e","l","l","o"]
Natija: ["o","l","l","e","h"]

def reverseString(s: list) -> list:
 return s[::-1]

def letterCombinations(self, digits: str) -> List[str]:
        if not digits:
            return []
        
        L = {
            '2': ['a', 'b', 'c'],
            '3': ['d', 'e', 'f'],
            '4': ['g', 'h', 'i'],
            '5': ['j', 'k', 'l'],
            '6': ['m', 'n', 'o'],
            '7': ['p', 'q', 'r', 's'],
            '8': ['t', 'u', 'v'],
            '9': ['w', 'x', 'y', 'z']
        }
        
        natija = ['']
        
        for son in digits:
            tmp = []
            for a in natija:
                for letter in L[son]:
                    tmp.append(a + letter)
            natija = tmp
        
        return natija

Ikki tartiblangan massiv nums1va nums2hajmi mva mos ravishda berilgan holda, ikkita tartiblangan massivning medianasinin qaytaring .

Umumiy ish vaqti murakkabligi bo'lishi kerak O(log (m+n)).

1-misol:

Kirish: x = 123
 Chiqish: 321
2-misol:

Kirish: x = -123
 Chiqish: -321
3-misol:

Kirish: x = 120
 Chiqish: 21
 

Cheklovlar:

-231 <= x <= 231 - 1