Commit 0b9309c

authored

Merge pull request #4 from 149ps/main

Main

2 parents 639b6ae + f17c5c9 commit 0b9309cCopy full SHA for 0b9309c

File tree

+53

-8

lines changed

+53

-8

lines changed

Lines changed: 47 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,47 @@`
	`1`	`+"""`
	`2`	`+Given a 2D grid of size m x n and an integer k. You need to shift the grid k times.`
	`3`	`+`
	`4`	`+In one shift operation:`
	`5`	`+`
	`6`	`+Element at grid[i][j] moves to grid[i][j + 1].`
	`7`	`+Element at grid[i][n - 1] moves to grid[i + 1][0].`
	`8`	`+Element at grid[m - 1][n - 1] moves to grid[0][0].`
	`9`	`+Return the 2D grid after applying shift operation k times.`
	`10`	`+`
	`11`	`+`
	`12`	`+`
	`13`	`+Example 1:`
	`14`	`+`
	`15`	`+`
	`16`	`+Input: grid = [[1,2,3],[4,5,6],[7,8,9]], k = 1`
	`17`	`+Output: [[9,1,2],[3,4,5],[6,7,8]]`
	`18`	`+Example 2:`
	`19`	`+`
	`20`	`+`
	`21`	`+Input: grid = [[3,8,1,9],[19,7,2,5],[4,6,11,10],[12,0,21,13]], k = 4`
	`22`	`+Output: [[12,0,21,13],[3,8,1,9],[19,7,2,5],[4,6,11,10]]`
	`23`	`+Example 3:`
	`24`	`+`
	`25`	`+Input: grid = [[1,2,3],[4,5,6],[7,8,9]], k = 9`
	`26`	`+Output: [[1,2,3],[4,5,6],[7,8,9]]`
	`27`	`+`
	`28`	`+`
	`29`	`+Constraints:`
	`30`	`+`
	`31`	`+m == grid.length`
	`32`	`+n == grid[i].length`
	`33`	`+1 <= m <= 50`
	`34`	`+1 <= n <= 50`
	`35`	`+-1000 <= grid[i][j] <= 1000`
	`36`	`+0 <= k <= 100`
	`37`	`+"""`
	`38`	`+class Solution:`
	`39`	`+ def shiftGrid(self, grid: List[List[int]], k: int) -> List[List[int]]:`
	`40`	`+ m,n = len(grid), len(grid[0])`
	`41`	`+ k = k % (m*n)`
	`42`	`+ temp = [grid[i][j] for i in range(m) for j in range(n)]`
	`43`	`+ temp = temp[-k:] + temp[:-k]`
	`44`	`+ result = []`
	`45`	`+ for i in range(m):`
	`46`	`+ result.append(temp[in:in+n])`
	`47`	`+ return result`

Lines changed: 6 additions & 8 deletions

Original file line number	Diff line number	Diff line change
`@@ -20,26 +20,24 @@`
`20`	`20`
`21`	`21`	`Note that an empty tree is represented by NULL, therefore you would see the expected output (serialized tree format) as [], not null.`
`22`	`22`	`"""`
`23`		`-`
`24`		`-`
`25`	`23`	`# Definition for a binary tree node.`
`26`	`24`	`# class TreeNode:`
`27`	`25`	`# def __init__(self, val=0, left=None, right=None):`
`28`	`26`	`# self.val = val`
`29`	`27`	`# self.left = left`
`30`	`28`	`# self.right = right`
`31`	`29`	`class Solution:`
`32`		`- def searchBST(self, root: TreeNode, val: int) -> TreeNode:`
`33`		`- if not root:`
`34`		`- return None`
	`30`	`+ def searchBST(self, root: Optional[TreeNode], val: int) -> Optional[TreeNode]:`
	`31`	`+ if not root: return None`
`35`	`32`	`q = collections.deque()`
`36`	`33`	`q.append(root)`
`37`	`34`	`while q:`
`38`	`35`	`node = q.popleft()`
`39`	`36`	`if node.val == val:`
`40`	`37`	`return node`
`41`		`- if node.left:`
`42`		`- q.append(node.left)`
`43`		`- if node.right:`
	`38`	`+ elif node.val < val and node.right:`
`44`	`39`	`q.append(node.right)`
	`40`	`+ else:`
	`41`	`+ if node.left:`
	`42`	`+ q.append(node.left)`
`45`	`43`	`return None`

Comments

(0)