2018年04月_mudamu88

原创排序算法模板(java)

1 快速排序 public class Solution { public void sort(int[] nums){ if (nums == null || nums.length == 0) return; quickSort(nums, 0, nums.legnth-1) } private void quickSort(in...

2018-04-23 09:39:40 495

原创 242. Valid Anagram

Given two strings s and t, write a function to determine if t is an anagram of s. For example, s = “anagram”, t = “nagaram”, return true. s = “rat”, t = “car”, return false. Note: You may assume ...

2018-04-22 23:48:32 123

A peak element is an element that is greater than its neighbors. Given an input array where num[i] ≠ num[i+1], find a peak element and return its index. The array may contain multiple peaks, in that...

2018-04-21 23:17:08 159

原创 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 are given a target value to search. If found ...

2018-04-21 22:24:57 558

原创 69. Sqrt(x)

Implement int sqrt(int x). Compute and return the square root of x, where x is guaranteed to be a non-negative integer Since the return type is an integer, the decimal digits are truncated and only ...

2018-04-21 21:18:34 141

原创 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 from left to right. The first integer of each r...

2018-04-21 17:04:31 150

原创 240. Search a 2D Matrix II

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 in ascending from left to right. Integers in ea...

2018-04-21 16:25:47 109

原创 153. Find Minimum 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). Find the minimum element. You may assume no duplicat...

2018-04-21 15:41:30 146

原创 189. Rotate Array

Rotate an array of n elements to the right by k steps. For example, with n = 7 and k = 3, the array [1,2,3,4,5,6,7] is rotated to [5,6,7,1,2,3,4]. Note: Try to come up as many solutions as you can,...

2018-04-21 13:39:15 127

原创 278. First Bad Version

第一个错误版本思路：二分法 You are a product manager and currently leading a team to develop a new product. Unfortunately, the latest version of your product fails the quality check. Since each version is devel...

2018-04-21 11:53:32 120

原创 226. Invert Binary Tree

Invert a binary tree. 4 / \ 2 7 / \ / \ 1 3 6 9 to 4 / \ 7 2 / \ / \ 9 6 3 1 **反转二叉树方法一**：引入一个队列进行层序遍历（leetcode时间超过20%的提交） /** * Definition ...

2018-04-13 20:43:51 114

原创 111. Minimum Depth of Binary Tree

Given a binary tree, find its minimum depth.The minimum depth is the number of nodes along the shortest path from the root node down to the nearest leaf node. 题意：找出二叉树的最小深度。 /** * Definition for a ...

2018-04-13 19:26:19 95

原创 104. Maximum Depth of Binary Tree

Given a binary tree, find its maximum depth. The maximum depth is the number of nodes along the longest path from the root node down to the farthest leaf node. For example: Given binary tree [3,9,2...

2018-04-13 17:46:36 138

原创 617. Merge Two Binary Trees

Given two binary trees and imagine that when you put one of them to cover the other, some nodes of the two trees are overlapped while the others are not. You need to merge them into a new binary tree...

2018-04-13 15:55:19 129

原创 669. Trim a Binary Search Tree

Given a binary search tree and the lowest and highest boundaries as L and R, trim the tree so that all its elements lies in [L, R] (R >= L). You might need to change the root of the tree, so the re...

2018-04-13 15:49:33 139

原创 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: Input: 3 / \ 9 20 / \ 15 7 Output: [3, 14.5, 11] Exp...

2018-04-13 15:43:52 144

木木