leetcode
文章平均质量分 59
denny851108
这个作者很懒,什么都没留下…
展开
-
[leetcode] 344. Reverse String
Write a function that takes a string as input and returns the string reversed.Example:Given s = "hello", return "oleo".SolutionIdea: swap charactersclass Solution {public: strin原创 2016-05-31 02:14:23 · 211 阅读 · 0 评论 -
[leetcode] 169. Majority Element
Given an array of size n, find the majority element. The majority element is the element that appears more than ⌊ n/2 ⌋ times.You may assume that the array is non-empty and the majority element原创 2016-05-30 11:00:32 · 530 阅读 · 0 评论 -
[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], after calling原创 2016-05-30 04:02:20 · 302 阅读 · 0 评论 -
[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 -> 4 and you are given the third node with val原创 2016-05-30 04:25:41 · 206 阅读 · 0 评论 -
[leetcode] 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.Solution:原创 2016-05-30 04:36:25 · 209 阅读 · 0 评论 -
[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", return false.Note:You may ass原创 2016-05-30 04:54:06 · 208 阅读 · 0 评论 -
[leetcode] 171. Excel Sheet Column Number
Given a column title as appear in an Excel sheet, return its corresponding column number.For example: A -> 1 B -> 2 C -> 3 ... Z -> 26 AA -> 27 AB -> 28 S原创 2016-05-30 10:13:42 · 197 阅读 · 0 评论 -
[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 should return false if every element原创 2016-05-30 10:17:56 · 230 阅读 · 0 评论 -
[leetcode] 350. Intersection of Two Arrays II
Given two arrays, write a function to compute their intersection.Example:Given nums1 = [1, 2, 2, 1], nums2 = [2, 2], return [2, 2].Note:Each element in the result should appear as ma原创 2016-05-31 03:52:57 · 175 阅读 · 0 评论 -
[leetcode] 326. Power of Three
Given an integer, write a function to determine if it is a power of three.Follow up:Could you do it without using any loop / recursion?check n =? 3^xSolution 1Idea: divide 3 to see w原创 2016-06-02 10:43:03 · 182 阅读 · 0 评论 -
[leetcode] 231. Power of Two
Given an integer, write a function to determine if it is a power of two.Solution 1Idea: divide n by 2, and check the residual. class Solution {public: bool isPowerOfTwo(int n) {原创 2016-06-02 11:10:41 · 245 阅读 · 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 betw原创 2016-06-01 12:23:34 · 193 阅读 · 0 评论 -
[leetcode] 206. Reverse Linked List
Reverse a singly linked list.Solution 1Idea: create a dummy node and insert node after dummy node /** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode原创 2016-06-01 11:35:12 · 544 阅读 · 0 评论 -
[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.any of the letters representing numbers in the Roman numerical system: I = 1, V = 5, X原创 2016-06-01 12:13:02 · 238 阅读 · 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 000000原创 2016-06-02 10:16:08 · 168 阅读 · 0 评论 -
[leetcode] 263. Ugly Number
Write a program to check whether a given number is an ugly number.Ugly numbers are positive numbers whose prime factors only include 2, 3, 5. For example, 6, 8 are ugly while 14 is not ugly si原创 2016-06-02 11:26:20 · 283 阅读 · 0 评论 -
[leetcode] 83. Remove Duplicates from Sorted List
Given a sorted linked list, delete all duplicates such that each element appear only once.For example,Given 1->1->2, return 1->2.Given 1->1->2->3->3, return 1->2->3.Solution:Compare th原创 2016-06-02 11:39:11 · 169 阅读 · 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?Solution 1idea: recursiv原创 2016-06-02 12:16:29 · 216 阅读 · 0 评论 -
[leetcode] 202. Happy Number
Write an algorithm to determine if a number is "happy".A happy number is a number defined by the following process: Starting with any positive integer, replace the number by the sum of the squares原创 2016-06-03 06:52:26 · 180 阅读 · 0 评论 -
[leetcode] 141. Linked List Cycle
Given a linked list, determine if it has a cycle in it.Follow up:Can you solve it without using extra space?Solution 1:Idea: construct a hash table using unordered_map/** * Definiti原创 2016-06-03 07:05:03 · 172 阅读 · 0 评论 -
[leetcode] 121. Best Time to Buy and Sell Stock
Say you have an array for which the ith element is the price of a given stock on day i.If you were only permitted to complete at most one transaction (ie, buy one and sell one share of the stock),原创 2016-06-03 10:36:31 · 163 阅读 · 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.SolutionIdea: create a new list, then compare the val原创 2016-06-03 12:20:51 · 265 阅读 · 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转载 2016-07-25 07:18:32 · 141 阅读 · 0 评论 -
[leetcode] 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-07-25 07:32:20 · 136 阅读 · 0 评论 -
[leetcode] 119. 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?解法一:这道题的转载 2016-07-25 07:50:20 · 155 阅读 · 0 评论 -
[leetcode] 9. Palindrome Number
Determine whether an integer is a palindrome. Do this without extra space.解法一:最naive的解法就是不考虑space的开销。先转成digits,再进一步比较vector。class Solution {public: bool isPalindrome(int x) {转载 2016-07-25 08:24:59 · 147 阅读 · 0 评论 -
[leetcode] 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-07-25 10:38:56 · 207 阅读 · 0 评论 -
[leetcode] 36. Valid Sudoku
Determine if a Sudoku is valid, according to: Sudoku Puzzles - The Rules.The Sudoku board could be partially filled, where empty cells are filled with the character '.'.A partially fille转载 2016-07-25 11:34:46 · 148 阅读 · 0 评论 -
[leetcode] 374. Guess Number Higher or Lower
We are playing the Guess Game. The game is as follows:I pick a number from 1 to n. You have to guess which number I picked.Every time you guess wrong, I'll tell you whether the number is h转载 2016-07-25 12:09:45 · 178 阅读 · 0 评论 -
[leetcode] 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.解法:recursive function. /**转载 2016-07-25 12:23:00 · 162 阅读 · 0 评论 -
[leetcode] 299. 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转载 2016-07-26 11:43:07 · 199 阅读 · 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 whet转载 2016-07-26 12:06:43 · 176 阅读 · 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 anot转载 2016-07-26 12:27:59 · 174 阅读 · 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 to转载 2016-07-27 11:27:08 · 160 阅读 · 0 评论 -
[leetcode] 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"]解法一:核心思转载 2016-07-27 11:47:13 · 173 阅读 · 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.解转载 2016-07-27 12:08:13 · 160 阅读 · 0 评论 -
[leetcode] 160. Intersection of Two Linked Lists
Write a program to find the node at which the intersection of two singly linked lists begins.For example, the following two linked lists: A: a1 → a2 ↘转载 2016-07-27 12:48:21 · 154 阅读 · 0 评论 -
[leetcode] 19. Remove Nth Node From End of List
Given a linked list, remove the nth node from the end of list and return its head.For example, Given linked list: 1->2->3->4->5, and n = 2. After removing the second node from the end, the转载 2016-07-28 06:43:31 · 139 阅读 · 0 评论 -
[leetcode] 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.转载 2016-07-28 07:24:42 · 215 阅读 · 0 评论 -
[leetcode] 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 as转载 2016-07-28 07:53:48 · 138 阅读 · 0 评论