LeetCode
文章平均质量分 72
彩虹之西
这个作者很懒,什么都没留下…
展开
-
[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 / 3return [1,2,3].Note: Recursiv原创 2014-02-25 12:26:19 · 570 阅读 · 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]]解题思路帕斯卡三角形,是一个原创 2014-02-26 11:58:20 · 639 阅读 · 0 评论 -
[LeetCode]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,#原创 2014-02-26 16:31:35 · 467 阅读 · 0 评论 -
[LeetCode]Binary Tree Postorder Traversal
题目描述Given a binary tree, return the postorder traversal of its nodes' values.For example:Given binary tree {1,#,2,3}, 1 \ 2 / 3return [3,2,1].Note: Recur原创 2014-02-27 11:44:55 · 519 阅读 · 0 评论 -
[LeetCode]Reverse Integer
题目描述Reverse digits of an integer.Example1: x = 123, return 321Example2: x = -123, return -321解题思路对求余数和求商的使用代码public int reverse(int x) { int num = 0; int sign = x原创 2014-02-27 13:55:30 · 536 阅读 · 0 评论 -
[LeetCode]String to Integer (atoi)
题目描述Implement atoi to convert a string to an integer.Hint: Carefully consider all possible input cases. If you want a challenge, please do not see below and ask yourself what are the possibl原创 2014-02-27 14:58:38 · 524 阅读 · 0 评论 -
[LeetCode]Decode Ways
题目描述A message containing letters from A-Z is being encoded to numbers using the following mapping:'A' -> 1'B' -> 2...'Z' -> 26Given an encoded message containing digits, determine th原创 2014-02-28 14:19:12 · 603 阅读 · 0 评论 -
[LeetCode]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 t原创 2014-02-28 17:14:57 · 598 阅读 · 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原创 2014-02-18 15:58:43 · 510 阅读 · 0 评论 -
[LeetCode]Roman to Integer
题目描述Given a roman numeral, convert it to an integer.Input is guaranteed to be within the range from 1 to 3999.给你一个罗马数字,将其转换成一个整数。输入保证在范围1-3999之间。解题思路 罗马数字基本字符: I、V、X、L、C、D、M原创 2014-02-20 15:47:12 · 615 阅读 · 0 评论 -
[LeetCode]Integer to Roman
题目描述Given an integer, convert it to a roman numeral.Input is guaranteed to be within the range from 1 to 3999.将阿拉伯数字转换为罗马数字,给你的数字范围是1之3999.解题思路必须将罗马数字及其构造规则说明一下:在罗马数字中, 利用7个不原创 2014-03-03 21:53:05 · 517 阅读 · 0 评论 -
[LeetCode]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原创 2014-03-03 22:08:29 · 618 阅读 · 0 评论 -
[LeetCode]Linked List Cycle
题目描述Given a linked list, determine if it has a cycle in it.Can you solve it without using extra space?给你一个链表,确定它是否有环的存在。最好不使用额外的空间解题思路采用“快慢指针”查检查链表是否含有环。让一个指针一次走一步,另一个一次走两步,如果链表中含有环,快的指针原创 2014-02-20 16:47:20 · 538 阅读 · 0 评论 -
[LeetCodeSearch 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原创 2014-03-03 22:25:34 · 658 阅读 · 0 评论 -
[LeetCode]Container With Most Water
题目描述Given n non-negative integers a1, a2, ..., an, where each represents a point at coordinate (i, ai). n vertical lines are drawn such that the two endpoints of line i is at (i, ai) and (i,原创 2014-03-03 15:29:54 · 1083 阅读 · 0 评论 -
[LeetCode]Reverse Nodes in k-Group
题目描述Given a linked list, reverse the nodes of a linked list k at a time and return its modified list.If the number of nodes is not a multiple of k then left-out nodes in the end should remai原创 2014-03-04 14:18:56 · 610 阅读 · 0 评论 -
[LeetCode]Insertion Sort List
题目描述Sort a linked list using insertion sort.使用插入排序法对一个链表进行排序解题思路刚开始看觉得so easy,直到真正写代码了,才发现好繁琐。我们对当前的node插入到已经排好序的链表中。我们用head和tail来表示已排序好子链表的头和尾。需要考虑node插入到head之前,插入到tail之后,和插入到he原创 2014-03-04 22:28:57 · 631 阅读 · 0 评论 -
[LeetCode]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 constan原创 2014-03-04 16:20:08 · 530 阅读 · 0 评论 -
[LeetCode]Pow(x, n)
题目描述Implement pow(x, n).求x^n解题思路介绍三种方法:用递归方法求n个x的乘积,注意考虑n的正负号,时间复杂度为O(n);考虑到n个x相乘式子的对称关系,可以对上述方法进行改进,从而得到一种时间复杂度为O(logn)的方法,递归关系可以表示为pow(x,n) = pow(x,n/2)*pow(x,n-n/2)另外还有一种十分巧妙并且快转载 2014-03-05 13:02:13 · 506 阅读 · 0 评论 -
[LeetCode]Single Number II
题目描述Given an array of integers, every element appears three times except for one. Find that single one.Note:Your algorithm should have a linear runtime complexity. Could you implement it w原创 2014-03-05 15:49:20 · 574 阅读 · 0 评论 -
[LeetCode]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:Giv原创 2014-03-04 16:49:21 · 464 阅读 · 0 评论 -
[LeecCode]Implement strStr()
题目描述Implement strStr().Returns a pointer to the first occurrence of needle in haystack, or null if needle is not part of haystack.给出一个字符串出现在另一个字符串中第一次出现位置的指针,如果没有,返回null。解题思路如果原创 2014-03-10 21:28:59 · 501 阅读 · 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.将两个有序的链表合并成一个解题思路通过比较两个链表的头节点,得到val较小的那个作为被原创 2014-03-05 21:44:13 · 482 阅读 · 0 评论 -
[LeetCode]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}, reor原创 2014-03-06 17:14:15 · 485 阅读 · 0 评论 -
[LeetCode]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:原创 2014-03-10 22:32:26 · 457 阅读 · 0 评论 -
[LeetCode]Construct Binary Tree from Inorder and Postorder Traversal
题目描述Given inorder and postorder traversal of a tree, construct the binary tree.Note:You may assume that duplicates do not exist in the tree.已知一棵二叉树的中序和后续遍历,构造出一棵二叉树。假设二叉树的节点无重复。解题思原创 2014-03-06 15:59:26 · 523 阅读 · 0 评论 -
[LeetCode]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 le原创 2014-03-06 14:14:39 · 511 阅读 · 0 评论 -
[LeetCode]Gas Station
题目分析There are N gas stations along a circular route, where the amount of gas at station i is gas[i].You have a car with an unlimited gas tank and it costs cost[i] of gas to travel from sta原创 2014-03-12 21:33:20 · 473 阅读 · 0 评论 -
[LeetCode]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"原创 2014-03-07 16:31:12 · 605 阅读 · 0 评论 -
[LeetCode]Reverse Words in a String
题目描述Given an input string, reverse the string word by word.For example,Given s = "the sky is blue",return "blue is sky the".将一个字符串中的单词逆序输出解题思路最直接的想法就是使用split函数将字符串以“”分割。但再实际过程中原创 2014-03-07 14:38:11 · 562 阅读 · 0 评论 -
[LeecCode]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: [原创 2014-03-07 14:59:08 · 536 阅读 · 0 评论 -
[LeetCode]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.由数字数组来表示的非负整原创 2014-03-10 15:40:23 · 492 阅读 · 0 评论 -
[LeetCode]Max Points on a Line
题目描述Given n points on a 2D plane, find the maximum number of points that lie on the same straight line.在一个平面上,给你大量的点,确定最多的点,使其能在同一条直线上解题思路 按照刚开始的想法,对于一条直线而言,其可以表示为y = kx + b 或 y =原创 2014-03-17 14:35:39 · 685 阅读 · 0 评论 -
[LeetCode]Add Two Numbers
题目描述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 twonumbers and return it原创 2014-03-19 15:23:30 · 388 阅读 · 0 评论 -
[LeetCode]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 N原创 2014-03-19 17:32:59 · 347 阅读 · 0 评论 -
[LeetCode]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.判断原创 2014-03-31 17:02:04 · 460 阅读 · 0 评论 -
[LeetCode]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 "()[]{}" ar原创 2014-03-21 17:14:03 · 421 阅读 · 0 评论 -
[LeetCode]Jump Game
题目描述Given an array of non-negative integers, you are initially positioned at the first index of the array.Each element in the array represents your maximum jump length at that position.D原创 2014-04-01 15:29:02 · 430 阅读 · 0 评论 -
[LeetCode]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.F原创 2014-05-03 20:55:41 · 529 阅读 · 0 评论 -
[LeetCode]Rotate Image
题目描述You are given an n x n 2D matrix representing an image.Rotate the image by 90 degrees (clockwise).Follow up:Could you do this in-place?将一个n*n的二维矩阵原地顺时针转90度解题思路如下图所示:原创 2014-04-02 16:45:54 · 532 阅读 · 0 评论