mine_song的博客

14. Longest Common PrefixWrite a function to find the longest common prefix string amongst an array of strings.leetcode解题之14# Longest Common Prefix Java版 两种方法实现

leetcode解题之20 # Valid Parentheses Java版 20. Valid ParenthesesGiven a string containing just the characters '(', ')', '{', '}', '[' and ']', determine if the input string is valid.The brackets must close in the correct order, "()" and "()[]{}" are all

27 Remove ElementGiven an array and a value, remove all instances of that value in place and return the new length.The order of elements can be changed. It doesn't matter what you leave beyond the new length.题目要求从数组中删除指定值的元素，并返回新数组的长度。leetcode解题之27

28 Implement strStr().Returns the index of the first occurrence of needle in haystack, or -1 if needle is not part of haystack.解：注意发生不匹配时重写匹配的起始位置leetcode解题之28 # Implement strStr() Java版

leetcode解题之206 # Reverse Linked List Java版 (使用头插法反转链表）

leetcode解题之219 # Contains Duplicate II Java版 (数组中出现重复元素

leetcode解题之225 # Implement Stack using Queuest Java版 (用两个队列实现一个栈）

leetcode解题之226# Invert Binary Tree Java版 (交换树的左右子树） 226. Invert Binary Tree

leetcode解题之258# Add Digits Java版 (相加各个位数）

leetcode解题之237# Delete Node in a Linked List Java版 (删除链表中指定的结点）

leetcode解题之242# Valid Anagram Java版 （判断两个字母串是否具有相同的字母组合）

leetcode解题之268# Missing NumberJava版 (找出0~N中缺少的数字）

leetcode解题之303# Range Sum Query - Immutable Java版 (多次计算数组内任意两个下标之间的和)

1. Two Sum Given an array of integers, return indices of the two numbers such that they add up to a specific target.You may assume that each input would have exactly one solution, and you may no

leetcode解题之35#Search Insert Position Java版 递归和非递归实现

leetcode解题之476 # Number Complement Java版

leetcode解题之09#Palindrome Number Java版 两种方法实现，Determine whether an integer is a palindrome. Do this without extra space.

leetcode解题之07#Reverse Integer Java版 通过溢出测试，Reverse digits of an integer.Example1: x = 123, return 321Example2: x = -123, return -321Note:The input is assumed to be a 32-bit signed integer. Your function should return 0 when the reversed integer overf

leetcode解题之21# Merge Two Sorted Lists Java版 递归和非递归实现 21. Merge Two Sorted ListsMerge two sorted linked lists and return it as a new list. The new list should be made by splicing together the nodes of the first two lists.

leetcode解题之23.Merge k Sorted Lists Java版本（合并k个有序的链表）

leetcode解题之31. Next Permutation java 版（下一个排列）

leetcode解题之34. Search for a Range java 版（数字在排序数组中出现的次数）

leetcode解题之 74.Search a 2D Matrix java 版（在二维矩阵中查找） ，二分查找，240. Search a 2D Matrix II

leetcode解题之58 # Length of Last Word Java版

leetcode解题之66 # Plus One Java版

leetcode解题之414 # Third Maximum Number Java版

leetcode解题之67 # Add Binary Java版

leetcode解题之70 #Climbing Stairs Java版 （青蛙跳台阶）

leetcode解题之83 # Remove Duplicates from Sorted List Java版，删除链表重复元素

leetcode解题之88 #Merge Sorted Array Java版

leetcode解题之416#Partition Equal Subset SumJava版. 对半分（0-1背包，动态规划）

leetcode解题之100# Same Tree Java版,给定两个二叉树，判断这两棵树是否相等。

leetcode解题之101# Symmetric Tree Java版(对称树)

leetcode解题之53 # Maximum Subarray Java版

leetcode解题之122# Best Time to Buy and Sell Stock II

leetcode解题之 Combination Sum java 版（查找数字和DFS） ，深度优先遍历，回溯，39. Combination Sum ，40. Combination Sum II

508. Most Frequent Subtree Sum ， leetcode解题之 508. Most Frequent Subtree Sum II java 版（求子树和） 给一棵树，找出现次数最多的子树和。子树和就是一个结点以及它下方所有结点构成的子树的总和，在这些总和中找一个出现次数最多的结果，如果有很多个这样的结果，返回这些结果构成的数组。

leetcode解题之215. Kth Largest Element in an Array java 版（第k大的数字）

leetcode解题之347. Top K Frequent Elements &451. Sort Characters By Frequency,统计词频，最小堆，最大堆，hashmap

leetcode解题之107 # Binary Tree Level Order Traversal II Java版