LeetCode
文章平均质量分 62
redis_v
这个作者很懒,什么都没留下…
展开
-
LeetCode:Bulb Switcher
题目描述: There are n bulbs that are initially off. You first turn on all the bulbs. Then, you turn off every second bulb. On the third round, you toggle every third bulb (turning on if it's off or t原创 2016-01-17 18:47:06 · 485 阅读 · 0 评论 -
LeetCode:Linked List Cycle
题目描述: Linked List Cycle Given a linked list, determine if it has a cycle in it. Follow up: Can you solve it without using extra space? 思路: 双指针遍历链表,oneNode每次向前走一步,twoNode每次向前走两步。若两个指针相遇,就有环原创 2016-01-18 11:28:21 · 495 阅读 · 0 评论 -
LeetCode:Linked List Cycle II
题目描述: 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原创 2016-01-18 12:14:57 · 789 阅读 · 1 评论 -
LeetCode:Missing Number And First Missing Positive
1、 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原创 2016-01-11 21:26:04 · 693 阅读 · 1 评论 -
LeetCode:Largest Number
179. Largest Number 题目描述: Given a list of non negative integers, arrange them such that they form the largest number. For example, given [3, 30, 34, 5, 9], the largest formed number is 95343原创 2016-01-12 17:17:26 · 490 阅读 · 0 评论 -
LeetCode:Game of Life
题目描述: According to the Wikipedia's article: "The Game of Life, also known simply as Life, is a cellular automaton devised by the British mathematician John Horton Conway in 1970." Given a board原创 2016-01-14 09:48:16 · 818 阅读 · 0 评论 -
LeetCode:Product of Array Except Self
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[原创 2016-01-14 11:26:08 · 417 阅读 · 0 评论 -
Leetcode:Increasing Triplet Subsequence
Increasing Triplet Subsequence 题目: Given an unsorted array return whether an increasing subsequence of length 3 exists or not in the array. Formally the function should: Return true if there原创 2016-02-17 17:23:38 · 768 阅读 · 0 评论 -
LeetCode:Integer Break
Given a positive integer n, break it into the sum of at least two positive integers and maximize the product of those integers. Return the maximum product you can get. For example, given n = 2, retur原创 2016-08-31 19:50:40 · 412 阅读 · 0 评论