算法
文章平均质量分 50
luckyu1
这个作者很懒,什么都没留下…
展开
-
leetcode之 Summary Ranges
题目:Given a sorted integer array without duplicates, return the summary of its ranges.For example, given [0,1,2,4,5,7], return ["0->2","4->5","7"].Credits:Special thanks to @jiancha原创 2016-01-26 19:34:49 · 230 阅读 · 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 jis at most原创 2016-01-23 20:56:03 · 173 阅读 · 0 评论 -
leetcode之 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原创 2016-01-23 20:50:02 · 208 阅读 · 0 评论 -
leetcode之Reverse Bits
题目:Reverse bits of a given 32 bits unsigned integer.For example, given input 43261596 (represented in binary as 00000010100101000001111010011100), return 964176192 (represented in binary as0原创 2016-01-23 20:46:41 · 179 阅读 · 0 评论 -
leetcode之valid sudoku
题目:Determine if a Sudoku is valid解答:就是分别对行,列,宫格进行出现的数字的判断即可class Solution {public: bool isValidSudoku(vector>& board) { memset(cols,0,sizeof(cols)); memset(rows,0,sizeof(r原创 2016-01-23 20:43:14 · 256 阅读 · 0 评论 -
leetcode之 Merge Sorted Array
题目:Given two sorted integer arrays nums1 and nums2, merge nums2 into nums1 as one sorted array.解答:由于最终位数固定,直接从后往前用两个指针即可class Solution {public: void merge(vector& nums1, int m, vector原创 2016-01-23 20:05:04 · 181 阅读 · 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.解答:很简单的DFS,可以加入一个剪枝原创 2016-01-23 19:35:39 · 170 阅读 · 0 评论 -
leetcode之Intersection of Two Linked Lists
题目:Write a program to find the node at which the intersection of two singly linked lists begins.解答:作为曾经面度娘实习被问的题目之一,看到之后格外温馨(然而面度娘的时候还并没有刷过一道leetcode。。。其实把图画出来就会很简单,如果两个链表由交点,那么最终一定是链表终点是一原创 2016-01-23 19:31:57 · 179 阅读 · 0 评论 -
leetcode之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() -- Re原创 2016-01-23 19:24:24 · 178 阅读 · 0 评论 -
leetcode之Palindrome Number
题目:Determine whether an integer is a palindrome. Do this without extra space.解答:首先知道这个数字一共多少位,然后进行高低位逐位比较,同时注意负数肯定不是,好吧 直到今天我才知道csdn可以直接插入代码class Solution {public: bool isPalindrome(int x原创 2016-01-23 19:22:32 · 209 阅读 · 0 评论 -
leetcode之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.解答:简单的DFS/** * Definition for a binar原创 2016-01-23 19:16:44 · 153 阅读 · 0 评论 -
leetcode之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,#,#,15,7}, 3 / \ 9原创 2016-01-23 19:15:22 · 179 阅读 · 0 评论 -
leetcode之 Factorial Trailing Zeroes
题目:Given an integer n, return the number of trailing zeroes in n!.解答:首先要明白,产生0的只有2和5相乘,其次所有的约数中2的数目肯定比5多,所以直接看1~n这n个数中一共能分解出多少个5就是最终n!中的0的个数所以代码就很简单了class Solution {public:原创 2016-01-23 19:12:11 · 186 阅读 · 0 评论 -
leetcode之 Pascal's Triangle && Pascal's Triangle II
题目:题目:(只贴了 Pascal's Triangle的题目,II的不贴了,思想在下面一起介绍,下面只贴 Pascal's Triangle II的代码)Given numRows, generate the first numRows of Pascal's triangle.For example, given numRows = 5,Return[原创 2016-01-23 19:07:38 · 200 阅读 · 0 评论 -
leetcode之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原创 2016-01-23 21:02:40 · 185 阅读 · 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 "()[]{}" a原创 2016-01-25 14:02:04 · 169 阅读 · 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原创 2016-01-25 14:12:39 · 243 阅读 · 0 评论 -
leetcode之Count Primes
题目:Description:Count the number of prime numbers less than a non-negative number, n.解答:此题利用的是类似于排除法,具体做法题目中的hint讲的很清楚class Solution {public: int countPrimes(int n) { i原创 2016-01-25 15:26:43 · 270 阅读 · 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 NA原创 2016-01-25 15:17:33 · 184 阅读 · 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" i原创 2016-01-25 15:15:09 · 316 阅读 · 0 评论 -
leetcode之 Reverse Integer
题目:Reverse digits of an integer.Example1: x = 123, return 321Example2: x = -123, return -321解答:每次求出当前最低位,同时用迭代求倒过来的值(不需要对负数进行先变正的操作)注意一个数字在倒过来的时候是可能出现溢出的,需要进行溢出检查class Solu原创 2016-01-25 15:11:36 · 226 阅读 · 0 评论 -
leetcode之Range Sum Query - Immutable
题目:Given an integer array nums, find the sum of the elements between indices i and j (i ≤ j), inclusive.Example:Given nums = [-2, 0, 3, -5, 2, -1]sumRange(0, 2) -> 1sumRange(2, 5) ->原创 2016-01-25 15:02:11 · 209 阅读 · 0 评论 -
leetcode之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-01-25 14:58:41 · 198 阅读 · 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?解答:首先用一个fast指针和一个slow指针找到这个list的中点,然后将后面半段直接reverse,(如何用O(n)时间和原创 2016-01-25 14:56:28 · 236 阅读 · 0 评论 -
leetcode之Add Binary
题目:Given two binary strings, return their sum (also a binary string).For example,a = "11"b = "1"Return "100".解答:class Solution {public: string addBinary(string a, string b原创 2016-01-25 14:53:12 · 201 阅读 · 0 评论 -
leetcode之 Longest Common Prefix
题目:Write a function to find the longest common prefix string amongst an array of strings.解答:以第一个初始化,后面逐个比较即可class Solution {public: string longestCommonPrefix(vector& strs) { if(s原创 2016-01-25 14:50:05 · 195 阅读 · 0 评论 -
leetcode之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 rea原创 2016-01-25 14:47:34 · 194 阅读 · 0 评论 -
leetcode之Remove Linked List Elements
题目:Remove all elements from a linked list of integers that have value val.ExampleGiven: 1 --> 2 --> 6 --> 3 --> 4 --> 5 --> 6, val = 6Return: 1 --> 2 --> 3 --> 4 --> 5Credits:Speci原创 2016-01-25 14:43:12 · 222 阅读 · 0 评论 -
leetcode之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原创 2016-01-25 14:34:38 · 227 阅读 · 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原创 2016-01-25 14:22:27 · 204 阅读 · 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.解答:只有原创 2016-01-21 22:11:55 · 201 阅读 · 0 评论 -
leetcode之 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 p原创 2016-01-21 22:10:20 · 173 阅读 · 0 评论 -
leetcode之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原创 2016-01-19 20:30:02 · 214 阅读 · 0 评论 -
leetcode之majority number
题目: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原创 2016-01-19 20:28:04 · 264 阅读 · 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 ele原创 2016-01-19 20:23:29 · 183 阅读 · 0 评论 -
leetcode 之 Excel Sheet Column Number
题目:Related to question Excel Sheet Column TitleGiven a column title as appear in an Excel sheet, return its corresponding column number.解答:简单的stringToint,就是转化26进制数,直接迭代即可class So原创 2016-01-19 20:19:33 · 216 阅读 · 0 评论 -
leetcode 之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:Yo原创 2016-01-19 20:14:08 · 197 阅读 · 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.原创 2016-01-19 20:11:08 · 230 阅读 · 0 评论 -
leetcode 之 invert binary tree
Invert a binary tree. 4 / \ 2 7 / \ / \1 3 6 9to 4 / \ 7 2 / \ / \9 6 3 1解法: 就是简单的递归class Solution {public: TreeNode* invertTree(TreeNode*原创 2016-01-19 20:09:50 · 208 阅读 · 0 评论 -
leetcode之move zeros
题目: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 ca原创 2016-01-19 19:59:33 · 292 阅读 · 0 评论