随笔分类 -  leetcode

637. Average of Levels in Binary Tree
摘要：Given a non-empty binary tree, return the average value of the nodes on each level in the form of an array. Example 1: （1）思想1：使用queue ，对二叉树进行层遍历。 C++： 阅读全文
posted @ 2017-12-18 22:07 西瓜刀刀刀 阅读(108) 评论(0) 推荐(0)
11. Container With Most Water
摘要：Given n non-negative integers a1, a2, ..., an, where each represents a point at coordinate (i, ai). n vertical lines are drawn such that the two endpo 阅读全文
posted @ 2017-12-18 21:47 西瓜刀刀刀 阅读(103) 评论(0) 推荐(0)
7. Reverse Integer
摘要：Given a 32-bit signed integer, reverse digits of an integer. Example 1: Example 2: Example 3: Note:Assume we are dealing with an environment which cou 阅读全文
posted @ 2017-12-15 10:19 西瓜刀刀刀 阅读(126) 评论(0) 推荐(0)
9. Palindrome Number
摘要：Determine whether an integer is a palindrome. Do this without extra space. Some hints: Could negative integers be palindromes? (ie, -1) If you are thi 阅读全文
posted @ 2017-12-14 16:23 西瓜刀刀刀 阅读(143) 评论(0) 推荐(0)
462. Minimum Moves to Equal Array Elements II
摘要：Given a non-empty integer array, find the minimum number of moves required to make all array elements equal, where a move is incrementing a selected e 阅读全文
posted @ 2017-12-14 16:02 西瓜刀刀刀 阅读(226) 评论(0) 推荐(0)
453. Minimum Moves to Equal Array Elements
摘要：Given a non-empty integer array of size n, find the minimum number of moves required to make all array elements equal, where a move is incrementing n  阅读全文
posted @ 2017-12-14 11:29 西瓜刀刀刀 阅读(242) 评论(0) 推荐(0)
728. Self Dividing Numbers
摘要：A self-dividing number is a number that is divisible by every digit it contains. For example, 128 is a self-dividing number because 128 % 1 == 0, 128 阅读全文
posted @ 2017-12-14 11:11 西瓜刀刀刀 阅读(161) 评论(0) 推荐(0)
686. Repeated String Match
摘要：Given two strings A and B, find the minimum number of times A has to be repeated such that B is a substring of it. If no such solution, return -1. For 阅读全文
posted @ 2017-12-12 22:17 西瓜刀刀刀 阅读(212) 评论(0) 推荐(0)
657. Judge Route Circle
摘要：Initially, there is a Robot at position (0, 0). Given a sequence of its moves, judge if this robot makes a circle, which means it moves back to the or 阅读全文
posted @ 2017-12-12 21:25 西瓜刀刀刀 阅读(146) 评论(0) 推荐(0)
717. 1-bit and 2-bit Characters
摘要：（1）代码： 阅读全文
posted @ 2017-12-11 22:38 西瓜刀刀刀 阅读(83) 评论(0) 推荐(0)
75. Sort Colors
摘要：Given an array with n objects colored red, white or blue, sort them so that objects of the same color are adjacent, with the colors in the order red, 阅读全文
posted @ 2017-12-11 22:22 西瓜刀刀刀 阅读(108) 评论(0) 推荐(0)
53. Maximum Subarray
摘要：Find the contiguous subarray within an array (containing at least one number) which has the largest sum. For example, given the array [-2,1,-3,4,-1,2, 阅读全文
posted @ 2017-12-07 10:41 西瓜刀刀刀 阅读(143) 评论(0) 推荐(0)
54. Spiral Matrix
摘要：Given a matrix of m x n elements (m rows, n columns), return all elements of the matrix in spiral order. For example, Given the following matrix: You 阅读全文
posted @ 2017-12-07 10:21 西瓜刀刀刀 阅读(136) 评论(0) 推荐(0)
74. Search a 2D Matrix
摘要：Write an efficient algorithm that searches for a value in an m x n matrix. This matrix has the following properties: Integers in each row are sorted f 阅读全文
posted @ 2017-12-06 22:27 西瓜刀刀刀 阅读(143) 评论(0) 推荐(0)
73. Set Matrix Zeroes
摘要：Given a m x n matrix, if an element is 0, set its entire row and column to 0. Do it in place. 给定一个m × n矩阵，如果一个元素为0，则将其整个行和列设置为0。 （1）思想1：用两个一维数组：flag_r 阅读全文
posted @ 2017-12-06 22:09 西瓜刀刀刀 阅读(122) 评论(0) 推荐(0)
81. Search in Rotated Sorted Array II
摘要：Suppose an array sorted in ascending order is rotated at some pivot unknown to you beforehand. (i.e., 0 1 2 4 5 6 7 might become 4 5 6 7 0 1 2). Write 阅读全文
posted @ 2017-12-05 15:50 西瓜刀刀刀 阅读(167) 评论(0) 推荐(0)
33. Search in Rotated Sorted Array
摘要：Suppose an array sorted in ascending order is rotated at some pivot unknown to you beforehand. (i.e., 0 1 2 4 5 6 7 might become 4 5 6 7 0 1 2). You a 阅读全文
posted @ 2017-12-05 15:36 西瓜刀刀刀 阅读(113) 评论(0) 推荐(0)