将一个给定字符串s根据给定的行数numRows,以从上往下、从左到右进行 Z 字形排列。 比如输入字符串为"PAYPALISHIRING"行数为 3 时,排列如下: Go P A H N A P L S I I G Y I R 之后,你的输出需要从左往右逐行读取,产生出一个新的字符串,比如:"PAHNAPLSIIGYIR"。 请你实现这个将字符串进行指定行数变换
Given a binary tree, return thezigzag level ordertraversal of its nodes' values. (ie, from left to right, then right to left for the next level and alternate between). For example: Given binary tree{3,9,20,#,#,15,7}, 3 / \ 9 20 / \ 15 7 1. 2. 3. 4. 5. return its zi...
如果第一步找不到符合条件的下标i,说明当前序列已经是一个最大的排列。那么应该直接执行第三步,生成最小的排列。 代码# Go packageleetcode// 解法一funcnextPermutation(nums[]int){i,j:=0,0fori=len(nums)-2;i>=0;i--{ifnums[i]<nums[i+1]{break}}ifi>=0{forj=len(nums)-1;j>i;j--{if...
binary tree level order traversal: BFS using queue. Can use queue.size instead of two queues. binary tree level order traversal II: BFS using queue. binary tree zig-zag level order traversal: BFS using stack. populating next right pointers in each node II and II: very special level order ...
[0006][Zig Zag Conversion] commit Jun 26, 2019 [0007][Reverse Integer] commit Jun 26, 2019 [0008][String To Integer (atoi)] commit Jun 26, 2019 [0009][Palindrome Number] commit Jun 26, 2019 [0010][Regular Expression Matching] commit Jun 24, 2019 [0011][Container With Most Water] co...
public ArrayList<Integer> inorderTraversal(TreeNode root) { ArrayList<Integer> result = new ArrayList<Integer>(); Stack<TreeNode> stack = new Stack<TreeNode>(); TreeNode curr = root; while (!stack.isEmpty() || curr != null) {
0006. Zig Zag Conversion 0007. Reverse Integer 0008. String to Integer Atoi 0009. Palindrome Number 0011. Container With Most Water 0012. Integer to Roman 0013. Roman to Integer 0014. Longest Common Prefix 0015.3 Sum 0016.3 Sum Closest 0017. Letter Combinations of a Phone Number 0018.4 Sum ...
虽然是一个二维矩阵,但是由于它特殊的有序性,所以完全可以按照下标把它看成一个一维矩阵,只不过需要行列坐标转换。最后利用二分搜索直接搜索即可。 代码# Go packageleetcodefuncsearchMatrix(matrix[][]int,targetint)bool{iflen(matrix)==0{returnfalse}m,low,high:=len(matrix[0]),0,len(matrix[0])*len(...
[0006][Zig Zag Conversion] commit Jun 26, 2019 [0007][Reverse Integer] commit Jun 26, 2019 [0008][String To Integer (atoi)] commit Jun 26, 2019 [0009][Palindrome Number] commit Jun 26, 2019 [0010][Regular Expression Matching] commit Jun 24, 2019 [0011][Container With Most Water] co...
[0006][Zig Zag Conversion] commit Jun 26, 2019 [0007][Reverse Integer] commit Jun 26, 2019 [0008][String To Integer (atoi)] commit Jun 26, 2019 [0009][Palindrome Number] commit Jun 26, 2019 [0010][Regular Expression Matching] commit Jun 24, 2019 [0011][Container With Most Water] co...