上一页 1 ··· 6 7 8 9 10 11 12 下一页

LeetCode-54-Spiral Matrix

摘要: 算法描述: Given a matrix of m x n elements (m rows, n columns), return all elements of the matrix in spiral order. Example 1: Example 2: 解题思路:模拟方法解决,注意边界及 阅读全文
posted @ 2019-01-29 21:30 无名路人甲 阅读(94) 评论(0) 推荐(0)

LeetCode-50-Pow(x,n)

摘要: 算法描述: Implement pow(x, n), which calculates x raised to the power n (xn). Example 1: Example 2: Example 3: Note: -100.0 < x < 100.0 n is a 32-bit sign 阅读全文
posted @ 2019-01-29 20:14 无名路人甲 阅读(94) 评论(0) 推荐(0)

LeetCode-49-Group Anagrams

摘要: 算法描述: Given an array of strings, group anagrams together. Example: Note: All inputs will be in lowercase. The order of your output does not matter. 解题 阅读全文
posted @ 2019-01-29 17:58 无名路人甲 阅读(87) 评论(0) 推荐(0)

LeetCode-48-Rotate Image

摘要: 算法描述: You are given an n x n 2D matrix representing an image. Rotate the image by 90 degrees (clockwise). Note: You have to rotate the image in-place, 阅读全文
posted @ 2019-01-29 17:13 无名路人甲 阅读(104) 评论(0) 推荐(0)

LeetCode-47-Permutations II

摘要: 算法描述: Given a collection of numbers that might contain duplicates, return all possible unique permutations. Example: 解题思路:题目要求返回所有可能的排列,因此首先想到回溯法。这道题的 阅读全文
posted @ 2019-01-29 16:50 无名路人甲 阅读(91) 评论(0) 推荐(0)

LeetCode-46-Permutations

摘要: 算法描述: Given a collection of distinct integers, return all possible permutations. Example: 解题思路:题目要求解除所有排列,首先想到的是回溯法。这个题目的关键点是去重。 阅读全文
posted @ 2019-01-29 16:04 无名路人甲 阅读(88) 评论(0) 推荐(0)

LeetCode-43-Multiply Strings

摘要: 算法描述: Given two non-negative integers num1 and num2 represented as strings, return the product of num1 and num2, also represented as a string. Example 阅读全文
posted @ 2019-01-29 15:32 无名路人甲 阅读(72) 评论(0) 推荐(0)

LeetCode-40-Combination Sum ||

摘要: 算法描述: Given a collection of candidate numbers (candidates) and a target number (target), find all unique combinations in candidates where the candidat 阅读全文
posted @ 2019-01-29 14:19 无名路人甲 阅读(107) 评论(0) 推荐(0)

LeetCode-39-Combination Sum

摘要: 算法描述: Given a set of candidate numbers (candidates) (without duplicates) and a target number (target), find all unique combinations in candidates wher 阅读全文
posted @ 2019-01-29 14:00 无名路人甲 阅读(109) 评论(0) 推荐(0)

LeetCode-36-Valid Sudoku

摘要: 算法描述: Determine if a 9x9 Sudoku board is valid. Only the filled cells need to be validated according to the following rules: A partially filled sudoku 阅读全文
posted @ 2019-01-29 13:31 无名路人甲 阅读(124) 评论(0) 推荐(0)
上一页 1 ··· 6 7 8 9 10 11 12 下一页