Python学习
文章平均质量分 56
每天都要有进步
这个作者很懒,什么都没留下…
展开
-
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原创 2015-08-27 11:13:57 · 227 阅读 · 0 评论 -
Leetcode #232 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(原创 2015-09-03 01:38:56 · 201 阅读 · 0 评论 -
Leetcode #238 Product of Array Except Self
Given an array of n integers where n > 1, nums, return an array output such that output[i] is equal to the product of all the elements of nums except nums[i].Solve it without division and in O原创 2015-09-02 22:03:08 · 240 阅读 · 0 评论 -
Leetcode #153 Find Minimum in Rotated Sorted Array
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 duplicate exists in原创 2015-09-04 02:58:34 · 240 阅读 · 0 评论 -
Leetcode #162 Find Peak Element
A peak element is an element that is greater than its neighbors.Given an input array where num[i] ≠ num[i+1], find a peak element and return its index.The array may contain multiple peaks, in原创 2015-09-09 00:12:39 · 255 阅读 · 0 评论 -
Leetcode #154 Find Minimum in Rotated Sorted Array II
Follow up for "Find Minimum in Rotated Sorted Array":What if duplicates are allowed?Would this affect the run-time complexity? How and why?Suppose a sorted array is rotated at some pivot unk原创 2015-09-04 03:00:10 · 239 阅读 · 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原创 2015-09-09 01:22:11 · 232 阅读 · 0 评论 -
Leetcode #142 Linked List Cycle II
Given a linked list, return the node where the cycle begins. If there is no cycle, return null.Note: Do not modify the linked list.Follow up:Can you solve it without using extra space?Di原创 2015-09-10 09:51:33 · 291 阅读 · 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 sinc原创 2015-09-11 01:15:10 · 260 阅读 · 0 评论 -
Leetcode #231 Power of Two
Given an integer, write a function to determine if it is a power of two.Credits:Special thanks to @jianchao.li.fighter for adding this problem and creating all test cases.Difficulty:Easy原创 2015-09-11 10:03:38 · 261 阅读 · 0 评论 -
Leetcode #145 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: Recursive solut原创 2015-08-31 22:22:00 · 275 阅读 · 0 评论 -
Leetcode #260 Single Number III
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 example:Given原创 2015-08-31 22:12:13 · 248 阅读 · 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原创 2015-08-28 04:25:48 · 235 阅读 · 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原创 2015-08-28 04:28:10 · 200 阅读 · 0 评论 -
Leetcode #226 Invert Binary Tree
Invert a binary tree. 4 / \ 2 7 / \ / \1 3 6 9to 4 / \ 7 2 / \ / \9 6 3 1Difficulty: Easy# Definition for a binary tree node.# class Tree原创 2015-08-28 23:47:52 · 301 阅读 · 0 评论 -
Leetcode #141 Linked List Cycle Python
Given a linked list, determine if it has a cycle in it.Follow up:Can you solve it without using extra space?Difficulty:Medium不占用额外地址的做法,两个node一个每次跳一次,一个每次跳两下next,如果碰到none就返回False,如果这个两个nod原创 2015-08-29 01:44:53 · 417 阅读 · 0 评论 -
Leetcode #136 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 using e原创 2015-08-09 00:48:03 · 211 阅读 · 0 评论 -
Leetcode #171 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.For example: A -> 1 B -> 2 C -> 3 ...原创 2015-08-30 10:41:17 · 214 阅读 · 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原创 2015-08-31 05:19:13 · 276 阅读 · 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原创 2015-08-31 09:21:10 · 239 阅读 · 0 评论 -
Leetcode #137 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 without u原创 2015-08-31 22:00:20 · 248 阅读 · 0 评论 -
Leetcode #268 Missing Number
Given an array containing n distinct numbers taken from 0, 1, 2, ..., n, find the one that is missing from the array.For example,Given nums = [0, 1, 3] return 2.Note:Your algorithm shoul原创 2015-09-12 11:45:15 · 244 阅读 · 0 评论