leetcode
文章平均质量分 72
蝌蚪123456
这个作者很懒,什么都没留下…
展开
-
15.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原创 2015-10-16 17:28:51 · 289 阅读 · 0 评论 -
14.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 sinc原创 2015-10-16 17:26:20 · 286 阅读 · 0 评论 -
21.Plus One
Given a non-negative number represented as an array of digits, plus one to the number.The digits are stored such that the most significant digit is at the head of the list.分析:首先判断所有的是否都为数字9,是的原创 2015-10-18 11:06:58 · 216 阅读 · 0 评论 -
25. Remove Element
Given 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.分原创 2015-10-19 12:04:49 · 211 阅读 · 0 评论 -
22.Power of Two
Given an integer, write a function to determine if it is a power of two.分析:题目意思是给定一个整数n,判断其是否为2的幂数。拿到题目之后很容易想到的方法是,我一直用n除以2,直到不能除尽,最后判断该值是否为1,为1返回true,不为1则返回false。方法二:用如果一个数为2的幂数,则n&(n-1)的结果应该是0原创 2015-10-19 10:01:14 · 242 阅读 · 0 评论 -
23.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]]分析:要看清楚下一行与上一行的关系。控制好循环结原创 2015-10-19 11:00:22 · 233 阅读 · 0 评论 -
34.Rotate Array
Rotate an array of n elements to the right by k steps.For example, with n = 7 and k = 3, the array [1,2,3,4,5,6,7] is rotated to [5,6,7,1,2,3,4].Note:Try to come up as many solutions as yo原创 2015-10-21 10:31:52 · 284 阅读 · 0 评论 -
30.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原创 2015-10-20 11:43:49 · 252 阅读 · 0 评论 -
29.Palindrome Number
Determine whether an integer is a palindrome. Do this without extra space.click to show spoilers.Some hints:Could negative integers be palindromes? (ie, -1)If you are thinking of converting the in原创 2015-10-20 11:30:55 · 237 阅读 · 0 评论 -
33.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.原创 2015-10-20 21:47:28 · 213 阅读 · 0 评论 -
36.Add Two Numbers (链表) Difficulty: Medium
You are given two linked lists representing two non-negative numbers. The digits are stored in reverse order and each of their nodes contain a single digit. Add the two numbers and return it as a link原创 2015-10-22 17:30:12 · 239 阅读 · 0 评论 -
37.Add Binary
Difficulty: EasyGiven two binary strings, return their sum (also a binary string).For example,a = "11"b = "1"Return "100".分析:这个题目是两个二进制字符串相加,然后返回二进制字符串。方法一:把这两个字符串都转换成整数,然后整数相加后,将结原创 2015-10-22 22:10:51 · 210 阅读 · 0 评论 -
40.Sqrt(x) (二分查找)
mplement int sqrt(int x).Compute and return the square root of x.分析:原创 2015-10-23 20:41:15 · 727 阅读 · 0 评论 -
42.Remove Linked List Elements
Remove all elements from a linked list of integers that have value val.Difficulty: EasyExampleGiven: 1 --> 2 --> 6 --> 3 --> 4 --> 5 --> 6, val = 6Return: 1 --> 2 --> 3 --> 4 --> 5分析,这个题目是删除原创 2015-10-24 12:24:22 · 235 阅读 · 0 评论 -
43.Palindrome Linked List
Given a singly linked list, determine if it is a palindrome. Difficulty: EasyFollow up:Could you do it in O(n) time and O(1) space?分析:思路是首先把链表分成前后两段(两段长度差0或1),然后转置其中的一段,再比较两个链表的值是否相等。/*原创 2015-10-24 23:07:02 · 231 阅读 · 0 评论 -
44.Swap Nodes in Pairs
Given a linked list, swap every two adjacent nodes and return its head.For example,Given 1->2->3->4, you should return the list as 2->1->4->3.Your algorithm should use only constant space. Y原创 2015-10-25 12:02:15 · 243 阅读 · 0 评论 -
45.Reorder List
Given a singly linked list L: L0→L1→…→Ln-1→Ln,reorder it to: L0→Ln→L1→Ln-1→L2→Ln-2→…You must do this in-place without altering the nodes' values.For example,Given {1,2,3,4}, reorder it to原创 2015-10-25 16:46:26 · 255 阅读 · 0 评论 -
46.Rotate List
Given a list, rotate the list to the right by k places, where k is non-negative.For example:Given 1->2->3->4->5->NULL and k = 2,return 4->5->1->2->3->NULL.分析:题目要求将给定的链表按照向右走k步。Step1:让p原创 2015-10-26 22:58:26 · 194 阅读 · 0 评论 -
2.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原创 2015-10-13 19:34:42 · 442 阅读 · 0 评论 -
4.Delete Node in a Linked List
Delete Node in a Linked List leetcode中原题如下: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原创 2015-10-13 21:16:10 · 299 阅读 · 0 评论 -
6.Move Zeroes
leetcode中的原题目如下: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,原创 2015-10-14 10:47:17 · 264 阅读 · 0 评论 -
8.Contains Duplicate
leetcode原题如下: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原创 2015-10-15 17:41:36 · 327 阅读 · 0 评论 -
18.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原创 2015-10-18 09:12:45 · 249 阅读 · 0 评论 -
57. 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.注意:本题目求的是二叉树的根节点到叶子节点的最短路径。要保证最后终止原创 2016-01-22 16:33:25 · 255 阅读 · 0 评论 -
5.Same Tree
leetcode上题目原文如下: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原创 2015-10-14 09:38:18 · 252 阅读 · 0 评论 -
59. 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 jis at most k.确原创 2016-01-22 20:47:39 · 197 阅读 · 0 评论 -
60. 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-01-22 21:33:26 · 203 阅读 · 0 评论 -
62.Odd Even Linked List
Given a singly linked list, group all odd nodes together followed by the even nodes. Please note here we are talking about the node number and not the value in the nodes.You should try to do it in原创 2016-01-23 11:21:09 · 175 阅读 · 0 评论 -
63. Roman to Integer
Given a roman numeral, convert it to an integer.Input is guaranteed to be within the range from 1 to 3999.题目要求将给定的罗马字符串转化成整数。罗马数字共有七个,即I(1),V(5),X(10),L(50),C(100),D(500),M(1000)。按照下面的规则原创 2016-01-23 12:16:16 · 212 阅读 · 0 评论 -
64. 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?(待求解!!!!)题目要求,判断给定的数字是否为3的幂数。如81返回true,71返回false。/*原创 2016-01-23 15:45:08 · 238 阅读 · 0 评论 -
17.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.分析,在做的时候设置两个节点p,q。始终保持h原创 2015-10-17 11:30:24 · 253 阅读 · 0 评论 -
67. 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-01-23 17:33:44 · 187 阅读 · 0 评论 -
68. 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].分析:输出指定的第k行的杨辉三角上的值。(从第0行开始算起).k为负数时返回1.注意,在写代码的过程中要保存上一行的值以用于下一行的计算。还有,要注意新建list对象,以免原创 2016-01-23 17:55:09 · 176 阅读 · 0 评论 -
69. 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 addit原创 2016-01-23 20:11:06 · 202 阅读 · 0 评论 -
72. 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 tota原创 2016-01-24 11:07:26 · 316 阅读 · 0 评论 -
73. 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-01-24 11:26:16 · 175 阅读 · 0 评论 -
75.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-01-24 12:19:14 · 203 阅读 · 0 评论 -
61. Implement Stack using Queues
mplement 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-01-22 21:57:35 · 205 阅读 · 0 评论 -
74.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-01-24 12:07:42 · 168 阅读 · 0 评论 -
78.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-01-24 16:00:14 · 199 阅读 · 0 评论