LeetCode
konsy_dong
Java,C++,Python,linux
展开
-
LeetCode 35. Search 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 the array.原创 2017-03-16 12:48:10 · 339 阅读 · 0 评论 -
LeetCode 414. Third Maximum Number
Given a non-empty array of integers, return the third maximum number in this array. If it does not exist, return the maximum number. The time complexity must be in O(n).Example 1:Input: [3, 2,原创 2017-03-16 13:02:18 · 354 阅读 · 0 评论 -
LeetCode 66. Plus One
Given a non-negative integer represented as a non-empty array of digits, plus one to the integer.You may assume the integer do not contain any leading zero, except the number 0 itself.The digi原创 2017-03-16 13:13:40 · 783 阅读 · 0 评论 -
LeetCode 26. 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原创 2017-03-16 13:35:37 · 402 阅读 · 0 评论 -
LeetCode 27. Remove Element
题目:Given an array and a value, remove all instances of that value in place and return the new length.Do not allocate extra space for another array, you must do this in place with constant me原创 2017-03-16 13:54:38 · 490 阅读 · 0 评论 -
LeetCode 461. Hamming Distance
题目:The Hamming distance between two integers is the number of positions at which the corresponding bits are different.Given two integers x and y, calculate the Hamming distance.Note:原创 2017-03-16 18:27:01 · 405 阅读 · 0 评论 -
LeetCode 104. Maximum Depth of Binary Tree
题目: 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.思路: 使用递归求解非常容易,一个节点的深度等于它的左子树的深度和它的右子原创 2017-04-04 16:20:01 · 342 阅读 · 0 评论 -
LeetCode 141. 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?思路: 判断一个链表中是否有循环,运用快慢指针,如果有循环,肯定会相遇代码:/** * Definition for singly-linked list. * st原创 2017-04-04 16:20:24 · 245 阅读 · 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 0000000原创 2017-04-04 16:21:45 · 266 阅读 · 0 评论 -
LeetCode 203. Remove Linked List Elements
题目: Remove all elements from a linked list of integers that have value val.Example Given: 1 –> 2 –> 6 –> 3 –> 4 –> 5 –> 6, val = 6 Return: 1 –> 2 –> 3 –> 4 –> 5思路: 给定一个链表,删除链表中所有的val值 。 具体思路见代码注释。原创 2017-04-04 16:22:42 · 254 阅读 · 0 评论 -
LeetCode 234. Palindrome Linked List
题目: Given a singly linked list, determine if it is a palindrome.思路: 给定一个链表,判断它是不是回文链表 根据链表的奇偶分情况,然后反转后半段链表,与前半段比较。 代码:struct ListNode { int val; ListNode *next; ListNode(int x) : val(原创 2017-04-04 16:24:10 · 372 阅读 · 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原创 2017-04-04 16:22:09 · 244 阅读 · 0 评论 -
LeetCode 258. Add Digits
题目: Given a non-negative integer num, repeatedly add all its digits until the result has only one digit.For example:Given num = 38, the process is like: 3 + 8 = 11, 1 + 1 = 2. Since 2 has only one dig原创 2017-04-04 16:26:03 · 291 阅读 · 0 评论 -
LeetCode 292. Nim Game
题目: You are playing the following Nim Game with your friend: There is a heap of stones on the table, each time one of you take turns to remove 1 to 3 stones. The one who removes the last stone will be原创 2017-04-04 16:27:12 · 263 阅读 · 0 评论 -
LeetCode 344. Reverse String
题目: Write a function that takes a string as input and returns the string reversed.Example: Given s = “hello”, return “olleh”.思路: 逆序一个字符串,用reverse_iterator代码:class Solution {public: string rever原创 2017-04-04 16:27:32 · 289 阅读 · 0 评论 -
LeetCode 371. Sum of Two Integers
题目: Calculate the sum of two integers a and b, but you are not allowed to use the operator + and -.思路: 其实就是模拟进位 1.首先最低位相加是要进一的 2.然后在做第二位的运算 3.以此类推,一直到没有进位为止。代码:class Solution {public: int get原创 2017-04-04 16:28:32 · 497 阅读 · 0 评论 -
LeetCode 412. Fizz Buzz
题目: Write a program that outputs the string representation of numbers from 1 to n.But for multiples of three it should output “Fizz” instead of the number and for the multiples of five output “Buzz”.原创 2017-04-04 16:28:59 · 334 阅读 · 0 评论 -
LeetCode 463. Island Perimeter
题目: You are given a map in form of a two-dimensional integer grid where 1 represents land and 0 represents water. Grid cells are connected horizontally/vertically (not diagonally). The grid is complet原创 2017-04-04 16:29:28 · 464 阅读 · 0 评论 -
LeetCode 476. Number Complement
题目: Given a positive integer, output its complement number. The complement strategy is to flip the bits of its binary representation.Note: 1. The given integer is guaranteed to fit within the range o原创 2017-04-04 16:29:45 · 294 阅读 · 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. emp原创 2017-04-05 09:27:22 · 311 阅读 · 0 评论 -
LeetCode 496. Next Greater Element I
题目: You are given two arrays (without duplicates) nums1 and nums2 where nums1’s elements are subset of nums2. Find all the next greater numbers for nums1’s elements in the corresponding places of nums原创 2017-04-05 09:27:53 · 504 阅读 · 0 评论 -
LeetCode 189. Rotate Array
题目: Rotate an array of n elements to the right by k steps.For example, with n = 7 and k = 3, the array [1,2,3,4,5,6,7] is rotated to [5,6,7,1,2,3,4].Note: Try to come up as many solutions as you can,原创 2017-04-06 16:47:15 · 281 阅读 · 0 评论 -
LeetCode 88. Merge Sorted Array
题目: 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 + n) to hold addit原创 2017-04-06 16:16:58 · 324 阅读 · 0 评论 -
LeetCode 283. Move Zeroes
题目: 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 calling your原创 2017-04-06 16:48:35 · 297 阅读 · 0 评论 -
LeetCode 326. Power of Three
题目: Given an integer, write a function to determine if it is a power of three.Follow up: Could you do it without using any loop / recursion?思路: 判断一个数是否是3的幂,但是不建议用循环和递归。想到了用log函数,因为如果n是3的幂,那么log3(n)肯原创 2017-04-06 16:48:59 · 322 阅读 · 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 stock),原创 2017-04-06 16:43:59 · 414 阅读 · 0 评论 -
LeetCode 155. Min Stack
题目: Design a stack that supports push, pop, top, and retrieving the minimum element in constant time.push(x) – Push element x onto stack. pop() – Removes the element on top of the stack. top() –原创 2017-04-07 16:32:08 · 223 阅读 · 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原创 2017-03-17 20:36:54 · 252 阅读 · 0 评论 -
LeetCode 136. Single Number
题目:Given an array of integers, every eleme:nt appears twice except for one. Find that single one.Note:Your algorithm should have a linear runtime complexity. Could you implement it without u原创 2017-03-17 11:41:45 · 270 阅读 · 0 评论 -
LeetCode 231. Power of Two
题目: Given an integer, write a function to determine if it is a power of two.思路: 判断一个数是否是2的幂 2的N次幂的特点:仅有首位为1,其余各位都为0 代码:class Solution {public: bool isPowerOfTwo(int n) { return (n>0)原创 2017-04-04 16:23:32 · 277 阅读 · 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 should run in原创 2017-04-06 16:47:46 · 227 阅读 · 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 since原创 2017-04-08 14:58:53 · 260 阅读 · 0 评论 -
LeetCode 367. Valid Perfect Square
题目: Given a positive integer num, write a function which returns True if num is a perfect square else False.Note: Do not use any built-in library function such as sqrt.Example 1: Input: 16 Returns:原创 2017-04-08 14:59:51 · 366 阅读 · 0 评论 -
LeetCode 1. Two Sum
题目: Given an array of integers, return indices of the two numbers such that they add up to a specific target.You may assume that each input would have exactly one solution, and you may not use the sam原创 2017-04-09 11:21:11 · 323 阅读 · 0 评论 -
LeetCode 111. 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.思路: 找出最小深度,最小深度是叶节点到根节点的最短路径,如果根节点没有叶原创 2017-04-09 11:22:11 · 233 阅读 · 0 评论 -
LeetCode 226. Invert Binary Tree
题目: Invert a binary tree. 4 / \ 2 7 / \ / \1 3 6 9to 4 / \ 7 2 / \ / \9 6 3 1思路: 如果根节点为NULL直接返回NULL;否则 将左右子节点交换,再递归调用,返回根节点。代码:/** * Definition for a bi原创 2017-04-09 11:24:00 · 370 阅读 · 0 评论 -
LeetCode 404. Sum of Left Leaves
题目: Find the sum of all left leaves in a given binary tree.Example: 3 / \ 9 20 / \ 15 7There are two left leaves in the binary tree, with values 9 and 15 respectively. Return 24.思路:原创 2017-04-09 11:24:42 · 245 阅读 · 0 评论 -
LeetCode 532. K-diff Pairs in an Array
题目: Given an array of integers and an integer k, you need to find the number of unique k-diff pairs in the array. Here a k-diff pair is defined as an integer pair (i, j), where i and j are both number原创 2017-04-09 11:25:36 · 746 阅读 · 0 评论 -
LeetCode 21. 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.思路取a的长度,从后往前,如果当前不为空格,且当前位置>0,位置往前移动,计数加1代码1. 递归法:/** * D原创 2017-04-10 14:18:55 · 190 阅读 · 0 评论 -
LeetCode 507. Perfect Number
题目: We define the Perfect Number is a positive integer that is equal to the sum of all its positive divisors except itself.Now, given an integer n, write a function that returns true when it is a perf原创 2017-04-10 14:53:14 · 375 阅读 · 0 评论