leetcode algorithms
whu_zk
这个作者很懒,什么都没留下…
展开
-
leetcode: (260) Single Number III
【Question】Given an array of numbers nums, in which exactly two elements appear only once and all the other elements appear exactly twice. Find the two elements that appear only once.For exam原创 2015-09-24 01:17:20 · 376 阅读 · 0 评论 -
leetcode: (144) Binary Tree Preorder Traversal
【Question】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:原创 2015-09-05 18:22:24 · 290 阅读 · 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.方法原创 2015-09-05 16:00:56 · 296 阅读 · 0 评论 -
leetcode: (235) Lowest Common Ancestor of a Binary Search Tree
【Question】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 i原创 2015-09-05 16:17:30 · 259 阅读 · 0 评论 -
leetcode: (136) Single Number
【Question】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 w原创 2015-09-03 13:00:54 · 255 阅读 · 0 评论 -
leetcode: (206) Reverse Linked List
【Question】Reverse a singly linked list.借助一个辅助指针来保存当前指针的后一个节点,遍历一次即可/** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * ListNode(int x) :原创 2015-09-08 22:44:16 · 270 阅读 · 0 评论 -
leetcode: (201) Count Primes
Description:Count the number of prime numbers less than a non-negative number, n.Credits:Special thanks to @mithmatt for adding this problem and creating all test cases.由于对时间复杂度的要求,一直不能通原创 2015-08-31 21:52:27 · 353 阅读 · 0 评论 -
leetcode: (9) Palindrome Number
Determine whether an integer is a palindrome. Do this without extra space.方法一:首先求出x一共有多少位,然后从比最低位与最高位的值开始比较低位的值可以通过 x(pow(10,i))%10的得到高位的值首先要把第i位前面的去掉x- x/pow(10,count-i)*pow(10,count-i)然后高位的值原创 2015-08-29 22:54:38 · 371 阅读 · 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原创 2015-08-29 11:31:27 · 277 阅读 · 0 评论 -
leetcode: (219) Contains Duplicate II
【Question】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 andj is a原创 2015-08-28 20:50:16 · 326 阅读 · 0 评论 -
leetcode: (125) 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" is not a原创 2015-08-27 18:04:33 · 235 阅读 · 0 评论 -
leetcode: (118) Pascal's Triangle
【Question】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]]杨辉三角的特点是:每i行原创 2015-08-25 21:26:58 · 302 阅读 · 0 评论 -
leetcode: (104) Maximum Depth of Binary Tree
【Question】Given a binary tree, find its maximum depth.The maximum depth is the number of nodes along the longest path from the root node down to the farthest leaf node.利用递归/** * Definit原创 2015-09-05 15:37:00 · 284 阅读 · 0 评论 -
leetcode: (41) Populating Next Right Pointers in Each Node
【Question】Given a binary tree struct TreeLinkNode { TreeLinkNode *left; TreeLinkNode *right; TreeLinkNode *next; }Populate each next pointer to point to its n原创 2015-09-05 21:20:38 · 356 阅读 · 0 评论 -
leetcode: (141) Linked List Cycle
【Question】Given a linked list, determine if it has a cycle in it.Follow up:Can you solve it without using extra space?无环的话,必定最后一个节点指向NULL。有环的话,肯定会指向前面的节点。这一个不动步长的节点,一个每次移动一个节点,另一个每次移动两原创 2015-09-23 22:55:12 · 334 阅读 · 0 评论 -
leetcode: (283) Move Zeroes
【Question】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], aft原创 2015-09-23 12:48:58 · 362 阅读 · 0 评论 -
leetcode: (70) Climbing Stairs
【Question】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?可以发现规律nums[n原创 2015-09-18 18:08:28 · 317 阅读 · 0 评论 -
leetcode: (153) Find Minimum in Rotated Sorted Array
【Question】Suppose a sorted array is rotated at some pivot unknown to you beforehand.(i.e., 0 1 2 4 5 6 7 might become 4 5 6 7 0 1 2).Find the minimum element.You may assume no dupl原创 2015-09-11 19:31:56 · 228 阅读 · 0 评论 -
leetcode: (35) Search Insert Position
【Question】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原创 2015-09-06 13:22:30 · 278 阅读 · 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原创 2015-09-06 22:10:43 · 276 阅读 · 0 评论 -
leetcode: (226) Invert Binary Tree
【Question】Invert a binary tree. 4 / \ 2 7 / \ / \1 3 6 9to 4 / \ 7 2 / \ / \9 6 3 1Trivia:This problem was inspired by this original twe原创 2015-09-05 16:48:13 · 277 阅读 · 0 评论 -
leetcode: (122) Best Time to Buy and Sell Stock II
【Question】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原创 2015-09-11 08:26:34 · 233 阅读 · 0 评论 -
leetcode: (137) Single Number II
【Question】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 implemen原创 2015-09-24 23:35:23 · 336 阅读 · 0 评论 -
2016迅雷校园招聘笔试题(1)
生命游戏Time Limit: 1000/1000 MS (Java/Others) Memory Limit:65536/65536 K (Java/Others)Problem Description:生命游戏是英国数学家约翰·何顿·康威在1970年发明的细胞自动机。这是一个零玩家游戏,它包括一个无限大的二维矩形世界,这个世界是由无数小的方格组成。每个方格中居住着一个活着的或死了的细胞原创 2015-09-24 23:42:24 · 1431 阅读 · 0 评论 -
leetcode: (94) Binary Tree Inorder Traversal
【Question】Given a binary tree, return the inorder traversal of its nodes' values.For example:Given binary tree {1,#,2,3}, 1 \ 2 / 3return [1,3,2].Note: Rec原创 2015-09-05 23:08:23 · 281 阅读 · 0 评论 -
leetcode: (27) Remove Element
【Question】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原创 2015-08-25 19:54:54 · 226 阅读 · 0 评论 -
leetcode: (119) Pascal's Triangle II
【Question】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?原创 2015-08-25 22:28:19 · 329 阅读 · 0 评论 -
leetcode: (19) Remove Nth Node From End of List
【Question】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 f原创 2015-08-24 20:17:57 · 254 阅读 · 0 评论 -
leetcode: (202) Happy Number
【Question】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 su原创 2015-08-24 21:27:44 · 374 阅读 · 0 评论 -
leetcode: (6) 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 P L S I原创 2015-08-23 21:59:34 · 287 阅读 · 0 评论 -
leetcode: (21) Merge Two Sorted Lists
【Question】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.方法一:新建一个链表,比较l1->val和l2->val,一次插入到新建链表中 L原创 2015-08-24 13:18:13 · 237 阅读 · 0 评论 -
leetcode: (13) Roman to Integer
Given a roman numeral, convert it to an integer. Or, Given an integer, convert it to a roman numeral.Input is guaranteed to be within the range from 1 to 3999.【Roman numbers】原创 2015-08-21 15:08:42 · 228 阅读 · 0 评论 -
leetcode: (88) Merge Sorted Array
【Question】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 +原创 2015-08-26 13:41:54 · 263 阅读 · 0 评论 -
leetcode: (26) Remove Duplicates from Sorted Array
【Question】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原创 2015-08-25 19:29:05 · 274 阅读 · 0 评论 -
leetcode: (190) Reverse Bits
【Question】Reverse bits of a given 32 bits unsigned integer.For example, given input 43261596 (represented in binary as 00000010100101000001111010011100), return 964176192 (represented in bin原创 2015-08-25 11:13:21 · 268 阅读 · 0 评论 -
leetcode: (191) Number of 1 Bits
【Question】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 represe原创 2015-08-25 10:34:18 · 255 阅读 · 0 评论 -
leetcode: (83) Remove Duplicates from Sorted List
【Question】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.方法一:设置两个指原创 2015-08-25 17:45:21 · 259 阅读 · 0 评论 -
leetcode: (232) Implement Queue using Stacks
【Question】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 fron原创 2015-08-25 10:01:41 · 284 阅读 · 0 评论 -
leetcode: (263) Ugly Number
【Question】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原创 2015-08-25 08:57:36 · 311 阅读 · 0 评论 -
leetcode: (171) Excel Sheet Column Number
【Question】Related to question Excel Sheet Column TitleGiven a column title as appear in an Excel sheet, return its corresponding column number.For example: A -> 1 B -> 2 C -原创 2015-08-24 23:05:21 · 330 阅读 · 0 评论