leetcode
文章平均质量分 59
weizaishouex2010
在校研究生
展开
-
leetcode | House Robber
You are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed, the only constraint stopping you from robbing each of them is that adjacent house原创 2015-10-17 20:56:35 · 299 阅读 · 0 评论 -
leetcode | Single Number
Given an array of integers, every element appears twice except for one. Find that single one. Note: Your algorithm should have a linear runtime complexity. Could you implement it without using ext原创 2015-10-10 16:38:55 · 328 阅读 · 0 评论 -
leetcode | 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. /** * Definition for a binary tre原创 2015-10-10 17:27:25 · 343 阅读 · 0 评论 -
leetcode | Pascal's Triangle II
Given an index k, return the kth row of the Pascal's triangle. For example, given k = 3, Return [1,3,3,1]. Note: Could you optimize your algorithm to use only O(k) extra space? 第n行的第r个元素的表达原创 2015-10-14 18:56:09 · 272 阅读 · 0 评论 -
leetcode | Pascal's Triangle
Given numRows, generate the first numRows of Pascal's triangle. For example, given numRows = 5, Return [ [1], [1,1], [1,2,1], [1,3,3,1], [1,4,6,4,1] ] public class Solution {原创 2015-10-14 17:06:38 · 266 阅读 · 0 评论 -
leetcode | Nim Game
You are playing the following Nim Game with your friend: There is a heap of stones on the table, each time one of you take turns to remove 1 to 3 stones. The one who removes the last stone will be the原创 2015-10-13 16:26:55 · 1293 阅读 · 0 评论 -
leetcode | 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 bina原创 2015-10-14 20:07:47 · 317 阅读 · 0 评论 -
leetcode | Sqrt(x)
Implement int sqrt(int x). Compute and return the square root of x. public class Solution { public int mySqrt(int x) { int n = x; while(n*n>x) { n =原创 2015-10-13 16:58:41 · 259 阅读 · 0 评论 -
leetcode | 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原创 2015-10-15 18:17:00 · 216 阅读 · 0 评论 -
leetcode | 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原创 2015-10-15 21:09:50 · 249 阅读 · 0 评论 -
leetcode | 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. click to show follow up. Subscribe to see which companies asked this question 思路是以最外层的matrix[0]原创 2015-11-06 19:21:37 · 337 阅读 · 0 评论 -
leetcode | Palindrome Linked List 牛客网 |
Given a singly linked list, determine if it is a palindrome. Follow up: Could you do it in O(n) time and O(1) space? /** * Definition for singly-linked list. * public class ListNode { *原创 2015-09-19 12:21:18 · 312 阅读 · 0 评论 -
牛客网 | 集合栈
题目描述 请实现一种数据结构SetOfStacks,由多个栈组成,其中每个栈的大小为size,当前一个栈填满时,新建一个栈。该数据结构应支持与普通栈相同的push和pop操作。 给定一个操作序列int[][2] ope(C++为vector>),每个操作的第一个数代表操作类型,若为1,则为push操作,后一个数为应push的数字;若为2,则为pop操作,后一个数无意义。请返回一个i原创 2015-12-26 22:40:12 · 581 阅读 · 0 评论 -
leetcode | binary-tree-preorder-traversal
Given a binary tree, return the preorder traversal of its nodes' values. For example: Given binary tree{1,#,2,3}, 1 \ 2 / 3 return[1,2,3]. Note: Recursive solution原创 2016-03-21 18:13:40 · 262 阅读 · 0 评论 -
leetcode | 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:原创 2015-11-09 19:17:16 · 394 阅读 · 0 评论 -
leetcode | Bulls and Cows
You are playing the following Bulls and Cows game with your friend: You write down a number and ask your friend to guess what the number is. Each time your friend makes a guess, you provide a hint t原创 2015-11-09 18:21:47 · 545 阅读 · 0 评论 -
leetcode | Contains Duplicate III
Given an array of integers, find out whether there are two distinct indices i and j in the array such that the difference between nums[i] and nums[j] is at most t and the difference between i an转载 2015-10-06 16:49:36 · 284 阅读 · 0 评论 -
leetcode | 3Sum
Given an array S of n integers, are there elements a, b, c in S such that a + b + c = 0? Find all unique triplets in the array which gives the sum of zero. Note: Elements in a triplet (a,b,c)原创 2015-10-05 17:34:50 · 262 阅读 · 0 评论 -
leetcode | 3Sum Closest
Given an array S of n integers, find three integers in S such that the sum is closest to a given number, target. Return the sum of the three integers. You may assume that each input would have exact原创 2015-10-05 18:57:49 · 326 阅读 · 0 评论 -
leetcode | Move Zeroes
Given an array nums, write a function to move all 0's to the end of it while maintaining the relative order of the non-zero elements. For example, given nums = [0, 1, 0, 3, 12], after calling you原创 2015-11-05 18:49:34 · 291 阅读 · 0 评论 -
leetcode | Reverse Linked List
Reverse a singly linked list. click to show more hints. Hint: A linked list can be reversed either iteratively or recursively. Could you implement both? 这是迭代的方式 /** * Definition for singly-l原创 2015-09-18 18:09:40 · 263 阅读 · 0 评论 -
leetcode | 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原创 2015-11-05 19:32:04 · 260 阅读 · 0 评论 -
leetcode | Word Pattern
Given a pattern and a string str, find if str follows the same pattern. Examples: pattern = "abba", str = "dog cat cat dog" should return true.pattern = "abba", str = "dog cat cat fish"原创 2015-10-06 09:57:17 · 1568 阅读 · 0 评论 -
leetcode | 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原创 2015-10-06 11:55:20 · 277 阅读 · 0 评论 -
leetcode | 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原创 2015-11-05 23:02:45 · 249 阅读 · 0 评论 -
leetcode | Search Insert Position
Given a sorted array and a target value, return the index if the target is found. If not, return the index where it would be if it were inserted in order. You may assume no duplicates in the array.原创 2015-11-05 23:30:20 · 311 阅读 · 0 评论 -
leetcode | Contains Duplicate
Given an array of integers, find if the array contains any duplicates. Your function should return true if any value appears at least twice in the array, and it should return false if every element原创 2015-10-06 13:24:26 · 253 阅读 · 0 评论 -
leetcode | Contains Duplicate II
Given an array of integers and an integer k, find out whether there are two distinct indices i and j in the array such that nums[i] = nums[j] and the difference between i and j is at most k.原创 2015-10-06 13:41:59 · 285 阅读 · 0 评论 -
leetcode | Merge Two Sorted Lists
Merge 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. /** * Definition for singly-linked list. * public cla原创 2015-09-23 20:20:45 · 239 阅读 · 0 评论 -
牛客网 | 顺时针打印矩阵
输入一个矩阵,按照从外向里以顺时针的顺序依次打印出每一个数字,例如,如果输入如下矩阵: 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 则依次打印出数字1,2,3,4,8,12,16,15,14,13,9,5,6,7,11,10. import java.util.ArrayList; public class Solution { public stati原创 2015-10-21 20:20:18 · 511 阅读 · 0 评论 -
leetcode | binary-tree-inorder-traversal
题目描述 Given a binary tree, return the inorder traversal of its nodes' values. For example: Given binary tree{1,#,2,3}, 1 \ 2 / 3 return[1,3,2]. Note: Rec原创 2016-03-21 19:07:38 · 314 阅读 · 0 评论