Java
文章平均质量分 66
Yingying_code
这个作者很懒,什么都没留下…
展开
-
20. Valid Parentheses*
Given 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 va转载 2016-12-15 21:39:31 · 237 阅读 · 0 评论 -
225. Implement Stack using Queues**
Implement the following operations of a stack using queues.push(x) -- Push element x onto stack.pop() -- Removes the element on top of the stack.top() -- Get the top element.empty() -- Return whet原创 2016-12-15 22:16:35 · 221 阅读 · 0 评论 -
155. Min Stack*
Design a stack that supports push, pop, top, and retrieving the minimum element in constant time.push(x) -- Push element x onto stack.pop() -- Removes the element on top of the stack.top() -- Get原创 2016-12-17 00:18:27 · 199 阅读 · 0 评论 -
331. Verify Preorder Serialization of a Binary Tree
One way to serialize a binary tree is to use pre-order traversal. When we encounter a non-null node, we record the node's value. If it is a null node, we record using a sentinel value such as #.原创 2016-12-17 15:48:26 · 220 阅读 · 0 评论 -
456. 132 Pattern**
Given a sequence of n integers a1, a2, ..., an, a 132 pattern is a subsequence ai, aj, ak such that i j k and ai < ak j. Design an algorithm that takes a list of n numbers as input and check原创 2016-12-17 19:16:59 · 236 阅读 · 0 评论 -
Java Vector 类
转载自Java Vector 类Vector类实现了一个动态数组。和ArrayList和相似,但是两者是不同的:Vector是同步访问的。Vector包含了许多传统的方法,这些方法不属于集合框架。Vector主要用在事先不知道数组的大小,或者只是需要一个可以改变大小的数组的情况。Vector类支持4种构造方法。第一种构造方法创建一个默认的向量,默认大小为10:V转载 2016-12-21 19:44:04 · 311 阅读 · 0 评论 -
257. Binary Tree Paths*
Given a binary tree, return all root-to-leaf paths.For example, given the following binary tree: 1 / \2 3 \ 5All root-to-leaf paths are:["1->2->5", "1->3"]public List binar原创 2016-12-21 19:55:23 · 220 阅读 · 0 评论 -
235. Lowest Common Ancestor of a Binary Search Tree*
Given a binary search tree (BST), find the lowest common ancestor (LCA) of two given nodes in the BST.According to the definition of LCA on Wikipedia: “The lowest common ancestor is defined betwee原创 2016-12-21 20:35:12 · 214 阅读 · 0 评论 -
112. Path Sum*
Given a binary tree and a sum, determine if the tree has a root-to-leaf path such that adding up all the values along the path equals the given sum.For example:Given the below binary tree and sum原创 2016-12-21 21:13:55 · 227 阅读 · 0 评论 -
49. Group Anagrams**
Given an array of strings, group anagrams together.For example, given: ["eat", "tea", "tan", "ate", "nat", "bat"], Return:[ ["ate", "eat","tea"], ["nat","tan"], ["bat"]]Note: All inpu原创 2017-01-01 23:28:46 · 200 阅读 · 0 评论 -
17. Letter Combinations of a Phone Number**
Given a digit string, return all possible letter combinations that the number could represent.A mapping of digit to letters (just like on the telephone buttons) is given below.Input:Digit st原创 2017-01-02 00:00:49 · 287 阅读 · 0 评论 -
227. Basic Calculator II**
Implement a basic calculator to evaluate a simple expression string.The expression string contains only non-negative integers, +, -, *, / operators and empty spaces . The integer division should原创 2017-01-02 00:31:53 · 223 阅读 · 0 评论 -
22. Generate Parentheses**
Given n pairs of parentheses, write a function to generate all combinations of well-formed parentheses.For example, given n = 3, a solution set is:[ "((()))", "(()())", "(())()", "()(())原创 2017-01-02 01:04:02 · 186 阅读 · 0 评论 -
111. Minimum 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.My code:# Definition for a binar原创 2016-12-22 19:54:31 · 194 阅读 · 0 评论 -
100. Same Tree*
Given two binary trees, write a function to check if they are equal or not.Two binary trees are considered equal if they are structurally identical and the nodes have the same value.My code:原创 2016-12-22 20:00:59 · 201 阅读 · 0 评论 -
101. Symmetric Tree*
Given a binary tree, check whether it is a mirror of itself (ie, symmetric around its center).For example, this binary tree [1,2,2,3,4,4,3] is symmetric: 1 / \ 2 2 / \ / \3 4 4 3原创 2016-12-22 20:42:53 · 222 阅读 · 0 评论 -
103. Binary Tree Zigzag Level Order Traversal
Given a binary tree, return the zigzag level order traversal of its nodes' values. (ie, from left to right, then right to left for the next level and alternate between).For example:Given binary原创 2016-12-22 23:43:59 · 189 阅读 · 0 评论 -
3. Longest Substring Without Repeating Characters**
Given a string, find the length of the longest substring without repeating characters.Examples:Given "abcabcbb", the answer is "abc", which the length is 3.Given "bbbbb", the answer is "原创 2017-01-03 21:15:57 · 173 阅读 · 0 评论 -
290. Word Pattern*
Given a pattern and a string str, find if str follows the same pattern.Here follow means a full match, such that there is a bijection between a letter in pattern and a non-empty word in str.原创 2017-01-03 21:41:29 · 202 阅读 · 0 评论 -
230. Kth Smallest Element in a BST**
Given a binary search tree, write a function kthSmallest to find the kth smallest element in it.Note: You may assume k is always valid, 1 ≤ k ≤ BST's total elements.Follow up:What if the原创 2016-12-23 21:56:36 · 189 阅读 · 0 评论 -
105. Construct Binary Tree from Preorder and Inorder Traversal**
Given preorder and inorder traversal of a tree, construct the binary treepublic class Solution { public TreeNode buildTree(int[] preorder, int[] inorder) { return helper(0,0,inorder.leng原创 2016-12-24 12:38:32 · 227 阅读 · 0 评论 -
222. Count Complete Tree Nodes**
Given a complete binary tree, count the number of nodes.Definition of a complete binary tree from Wikipedia:In a complete binary tree every level, except possibly the last, is completely fille原创 2016-12-24 13:23:10 · 309 阅读 · 0 评论 -
199. Binary Tree Right Side View**
Given a binary tree, imagine yourself standing on the right side of it, return the values of the nodes you can see ordered from top to bottom.For example:Given the following binary tree, 1原创 2016-12-24 14:08:54 · 209 阅读 · 0 评论 -
173. Binary Search Tree Iterator**
mplement an iterator over a binary search tree (BST). Your iterator will be initialized with the root node of a BST.Calling next() will return the next smallest number in the BST.Note: next()原创 2016-12-24 14:35:54 · 292 阅读 · 0 评论 -
129. Sum Root to Leaf Numbers**
Given a binary tree containing digits from 0-9 only, each root-to-leaf path could represent a number.An example is the root-to-leaf path 1->2->3 which represents the number 123.Find the tota原创 2016-12-24 15:13:04 · 251 阅读 · 0 评论 -
337. House Robber III**
The thief has found himself a new place for his thievery again. There is only one entrance to this area, called the "root." Besides the root, each house has one and only one parent house. After a tour原创 2016-12-24 15:40:08 · 303 阅读 · 0 评论 -
116. Populating Next Right Pointers in Each Node**
Given a binary tree struct TreeLinkNode { TreeLinkNode *left; TreeLinkNode *right; TreeLinkNode *next; }Populate each next pointer to point to its next right node.原创 2016-12-24 18:20:06 · 199 阅读 · 0 评论 -
150. Evaluate Reverse Polish Notation**
Evaluate the value of an arithmetic expression in Reverse Polish Notation.Valid operators are +, -, *, /. Each operand may be an integer or another expression.Some examples: ["2", "1",原创 2016-12-18 22:55:04 · 283 阅读 · 0 评论 -
6. ZigZag Conversion*
The string "PAYPALISHIRING" is written in a zigzag pattern on a given number of rows like this: (you may want to display this pattern in a fixed font for better legibility)P A H NA P L S I原创 2016-12-24 22:37:34 · 207 阅读 · 0 评论 -
14. Longest Common Prefix**
Write a function to find the longest common prefix string amongst an array of strings.Method1:public class Solution { public String longestCommonPrefix(String[] strs) { if(strs==null |原创 2016-12-25 20:12:15 · 218 阅读 · 0 评论 -
434. Number of Segments in a String*
Count the number of segments in a string, where a segment is defined to be a contiguous sequence of non-space characters.Please note that the string does not contain any non-printable characters.原创 2016-12-25 20:48:39 · 261 阅读 · 0 评论 -
28. Implement strStr()*
Implement strStr().Returns the index of the first occurrence of needle in haystack, or -1 if needle is not part of haystack.My code: public int strStr(String haystack, String needle) {原创 2016-12-25 21:43:42 · 191 阅读 · 0 评论 -
38. Count and Say*
The count-and-say sequence is the sequence of integers beginning as follows:1, 11, 21, 1211, 111221, ...1 is read off as "one 1" or 11.11 is read off as "two 1s" or 21.21 is read off原创 2016-12-25 22:22:26 · 203 阅读 · 0 评论 -
71. Simplify Path**
Given an absolute path for a file (Unix-style), simplify it.For example,path = "/home/", => "/home"path = "/a/./b/../../c/", => "/c"click to show corner cases.Corner Cases:Did原创 2016-12-17 23:47:32 · 205 阅读 · 0 评论 -
102. Binary Tree Level Order Traversal*
Given a binary tree, return the level order traversal of its nodes' values. (ie, from left to right, level by level).For example:Given binary tree [3,9,20,null,null,15,7], 3 / \ 9 2原创 2016-12-19 23:15:21 · 165 阅读 · 0 评论 -
107. Binary Tree Level Order Traversal II*
Given a binary tree, return the bottom-up level order traversal of its nodes' values. (ie, from left to right, level by level from leaf to root).For example:Given binary tree [3,9,20,null,null,1原创 2016-12-19 23:44:43 · 242 阅读 · 0 评论 -
165. Compare Version Numbers*
Compare two version numbers version1 and version2.If version1 > version2 return 1, if version1 version2 return -1, otherwise return 0.You may assume that the version strings are non-empty and co原创 2016-12-27 21:30:47 · 241 阅读 · 0 评论 -
58. Length of Last Word*
Given a string s consists of upper/lower-case alphabets and empty space characters ' ', return the length of last word in the string.If the last word does not exist, return 0.Note: A word is原创 2016-12-27 21:35:35 · 245 阅读 · 0 评论 -
125. Valid Palindrome*
Given a string, determine if it is a palindrome, considering only alphanumeric characters and ignoring cases.For example,"A man, a plan, a canal: Panama" is a palindrome."race a car" is not a原创 2016-12-27 22:22:37 · 262 阅读 · 0 评论 -
205. Isomorphic Strings*
Given two strings s and t, determine if they are isomorphic.Two strings are isomorphic if the characters in s can be replaced to get t.All occurrences of a character must be replaced with anot原创 2017-01-04 22:55:42 · 194 阅读 · 0 评论