Leetcode
Decorator2015
开启我的CSDN之旅,啦啦啦~
展开
-
leetcode 13. Roman to Integer
题目Given a roman numeral, convert it to an integer. Input is guaranteed to be within the range from 1 to 3999.解class Solution { public int romanToInt(String s) { HashMap<Character,Integer>原创 2018-01-07 15:52:45 · 316 阅读 · 0 评论 -
leetcode 88. Merge Sorted Array
题目Given two sorted integer arrays nums1 and nums2, merge nums2 into nums1 as one sorted array.Note: You may assume that nums1 has enough space (size that is greater or equal to m + n) to hold addition原创 2016-06-13 10:35:10 · 308 阅读 · 0 评论 -
leetcode 223. Rectangle Area
题目Find the total area covered by two rectilinear rectangles in a 2D plane.Each rectangle is defined by its bottom left corner and top right corner as shown in the figure. Assume that the total area原创 2016-06-13 10:00:02 · 425 阅读 · 0 评论 -
leetcode 70. Climbing Stairs
题目You are climbing a stair case. It takes n steps to reach to the top.Each time you can either climb 1 or 2 steps. In how many distinct ways can you climb to the top?解//采用DP的办法public class Solution {原创 2016-05-27 15:02:01 · 280 阅读 · 0 评论 -
leetcode 219. 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.解1(超时)pub原创 2016-06-06 15:10:59 · 335 阅读 · 0 评论 -
leetcode 160. Intersection of Two Linked Lists
原文链接:http://blog.csdn.net/litoupu/article/details/41555557题目Write a program to find the node at which the intersection of two singly linked lists begins.For example, the following two linked lists: be转载 2016-06-06 14:54:12 · 355 阅读 · 0 评论 -
leetcode 232. Implement Queue using Stacks
题目Implement the following operations of a queue using stacks.push(x) – Push element x to the back of queue. pop() – Removes the element from in front of queue. peek() – Get the front element. empty(原创 2016-06-06 10:42:52 · 299 阅读 · 0 评论 -
leetcode 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 wheth原创 2016-06-06 11:22:45 · 384 阅读 · 0 评论 -
leetcode 319. Bulb Switcher
题目There are n bulbs that are initially off. You first turn on all the bulbs. Then, you turn off every second bulb. On the third round, you toggle every third bulb (turning on if it’s off or turning off原创 2016-05-23 15:04:36 · 290 阅读 · 0 评论 -
leetcode 122. Best Time to Buy and Sell Stock II
题目Say you have an array for which the ith element is the price of a given stock on day i.Design an algorithm to find the maximum profit. You may complete as many transactions as you like (ie, buy one a原创 2016-05-23 14:31:29 · 277 阅读 · 0 评论 -
leetcode 238. Product of Array Except Self
题目Given an array of n integers where n > 1, nums, return an array output such that output[i] is equal to the product of all the elements of nums except nums[i].Solve it without division and in O(n).For原创 2016-05-23 13:43:05 · 279 阅读 · 0 评论 -
leetcode 299. Bulls and Cows
题目guess, you provide a hint that indicates how many digits in said guess match your secret number exactly in both digit and position (called “bulls”) and how many digits match the secret number but loc原创 2016-06-13 11:00:05 · 441 阅读 · 0 评论 -
leetcode 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 another cha原创 2016-06-13 11:46:28 · 332 阅读 · 0 评论 -
leetcode 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 between t转载 2016-06-13 12:01:34 · 349 阅读 · 0 评论 -
leetcode 9. Palindrome Number
题目Determine whether an integer is a palindrome. Do this without extra space.解class Solution { public boolean isPalindrome(int x) { if(x<0) return false; int y=x; int res=0;原创 2018-01-07 15:34:35 · 296 阅读 · 0 评论 -
leetcode 14. Longest Common Prefix
题目Write a function to find the longest common prefix string amongst an array of strings.解class Solution { public String longestCommonPrefix(String[] strs) { //return ""; if(s原创 2018-01-07 15:29:42 · 309 阅读 · 0 评论 -
leetcode 7.Reverse Integer
题目Given a 32-bit signed integer, reverse digits of an integer.Example 1:Input: 123 Output: 321 Example 2:Input: -123 Output: -321 Example 3:Input: 120 Output: 21 Note: Assume we are dealing wit原创 2018-01-03 22:39:46 · 318 阅读 · 0 评论 -
leetcode 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 not use the same e原创 2018-01-02 20:23:12 · 247 阅读 · 0 评论 -
leetcode 461. Hamming Distance
题目The Hamming distance between two integers is the number of positions at which the corresponding bits are different.Given two integers x and y, calculate the Hamming distance.Note: Example The above原创 2017-12-30 22:01:35 · 241 阅读 · 0 评论 -
leetcode 371. Sum of Two Integers
题目Calculate the sum of two integers a and b, but you are not allowed to use the operator + and -.Example: Given a = 1 and b = 2, return 3.提示位运算解public class Solution { public int getSum(int a, int原创 2016-07-05 11:16:08 · 618 阅读 · 0 评论 -
leetcode 226. Invert Binary Tree(二叉树的镜像)
leetcode 226. Invert Binary Tree题目Total Accepted: 76777 Total Submissions: 172853 Difficulty: Easy Invert a binary tree.答案1(c++) /** * Definition for a binary tree node. * struct TreeNo原创 2016-03-15 16:54:19 · 602 阅读 · 0 评论 -
leetcode 21. 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 class原创 2016-05-27 17:24:06 · 272 阅读 · 0 评论 -
leetcode 206. Reverse Linked List
leetcode 206. Reverse Linked List题目 Reverse a singly linked list.解/** * Definition for singly-linked list. * public class ListNode { * int val; * ListNode next; * ListNode(int x) {原创 2016-03-25 16:15:40 · 530 阅读 · 0 评论 -
leetcode 144. Binary Tree Preorder Traversal
题目Given a binary tree, return the preorder traversal of its nodes’ values.For example: Given binary tree {1,#,2,3}, return [1,2,3].解(非递归方法)/** * Definition for a binary tree node. * public clas原创 2016-05-25 13:38:20 · 309 阅读 · 0 评论 -
leetcode 191. Number of 1 Bits
题目Write a function that takes an unsigned integer and returns the number of ’1’ bits it has (also known as the Hamming weight).For example, the 32-bit integer ’11’ has binary representation 00000000原创 2016-05-26 18:07:04 · 287 阅读 · 0 评论 -
leetcode 347. Top K Frequent Elements
题目Given a non-empty array of integers, return the k most frequent elements.For example, Given [1,1,1,2,2,3] and k = 2, return [1,2].Note: You may assume k is always valid, 1 ≤ k ≤ number of unique e转载 2016-05-25 10:37:39 · 293 阅读 · 0 评论 -
leetcode 258. Add Digits
Add DigitsGiven a non-negative integer num, repeatedly add all its digits until the result has only one digit.For example:Given num = 38, the process is like: 3 + 8 = 11, 1 + 1 = 2. Since 2 has only on原创 2016-02-24 16:30:31 · 425 阅读 · 0 评论 -
leetcode 283. Move Zeroes
leetcode 283. 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原创 2016-03-16 17:17:18 · 385 阅读 · 0 评论 -
leetcode 292. Nim Game(拿石子游戏)
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 sto原创 2016-02-24 16:22:39 · 1008 阅读 · 0 评论 -
leetcode 237. Delete Node in a Linked List
leetcode 237. Delete Node in a Linked List题目 Write a function to delete a node (except the tail) in a singly linked list, given only access to that node. Supposed the linked list is 1 -> 2 -> 3 ->原创 2016-03-17 10:42:54 · 564 阅读 · 0 评论 -
leetcode 100. Same Tree
100. Same Tree题目 1,Given two binary trees, write a function to check if they are equal or not. 2,Two binary trees are considered equal if they are structurally identical and the nodes have the sam原创 2016-03-18 10:23:16 · 607 阅读 · 0 评论 -
leetcode 242. Valid Anagram
leetcode 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”原创 2016-03-22 10:14:44 · 287 阅读 · 0 评论 -
leetcode 171. Excel Sheet Column Number
leetcode 171. Excel Sheet Column Number题目 Related to question Excel Sheet Column Title Given a column title as appear in an Excel sheet, return its corresponding column number. For example:原创 2016-03-22 16:00:19 · 318 阅读 · 0 评论 -
leetcode 217. Contains Duplicate
leetcode 217. 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 sho原创 2016-03-23 11:25:50 · 377 阅读 · 0 评论 -
leetcode 84. Largest Rectangle in Histogram
leetcode 84. Largest Rectangle in Histogram题目Given n non-negative integers representing the histogram’s bar height where the width of each bar is 1, find the area of largest rectangle in the histogram.原创 2016-03-23 15:28:54 · 382 阅读 · 0 评论 -
leetcode 343. Integer Break
题目Given a positive integer n, break it into the sum of at least two positive integers and maximize the product of those integers. Return the maximum product you can get.For example, given n = 2, return转载 2016-05-25 11:28:41 · 309 阅读 · 0 评论 -
leetcode 318. Maximum Product of Word Lengths
题目Given a string array words, find the maximum value of length(word[i]) * length(word[j]) where the two words do not share common letters. You may assume that each word will contain only lower case let原创 2016-05-25 14:35:02 · 374 阅读 · 0 评论 -
leetcode 94. Binary Tree Inorder Traversal
题目Given a binary tree, return the inorder traversal of its nodes’ values.For example: Given binary tree {1,#,2,3}, return [1,3,2].Note: Recursive solution is trivial, could you do it iteratively?转载 2016-05-26 10:24:18 · 369 阅读 · 0 评论 -
leetcode 172. Factorial Trailing Zeroes
题目Given an integer n, return the number of trailing zeroes in n!.Note: Your solution should be in logarithmic time complexity.解public class Solution { public int trailingZeroes(int n) { //计原创 2016-06-02 15:33:15 · 270 阅读 · 0 评论 -
leetcode 26. Remove Duplicates from Sorted Array
题目Given a sorted array, remove the duplicates in place such that each element appear only once and return the new length.Do not allocate extra space for another array, you must do this in place with co原创 2016-06-01 11:06:59 · 330 阅读 · 0 评论