LeetCode
好多鱼哦
数据挖掘、机器学习
展开
-
194. Transpose File
Given a text file file.txt, transpose its content. You may assume that each row has the same number of columns and each field is separated by the ' ' character. For example, if file.txt has th原创 2016-09-03 18:56:20 · 643 阅读 · 0 评论 -
190. 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 as 001110010原创 2016-07-30 10:54:24 · 195 阅读 · 0 评论 -
234. 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? 判断链表是否回文。 思路:将后半部分翻转,两个指针分别从头结点和中间的结点向后遍历。 /** * Definition for singly-linked原创 2016-07-29 22:28:13 · 193 阅读 · 0 评论 -
225. 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() -- Retur原创 2016-07-08 21:18:09 · 172 阅读 · 0 评论 -
299. 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 a hint t原创 2016-07-08 20:50:48 · 195 阅读 · 0 评论 -
38. 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 read off as原创 2016-07-19 15:00:53 · 193 阅读 · 0 评论 -
290. 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 in str.原创 2016-07-18 21:44:17 · 188 阅读 · 0 评论 -
257. Binary Tree Paths
Given a binary tree, return all root-to-leaf paths. For example, given the following binary tree: 1 / \ 2 3 \ 5 All root-to-leaf paths are: ["1->2->5", "1->3"] 思路:路径遍历。深度遍原创 2016-07-18 20:58:07 · 190 阅读 · 0 评论 -
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. 利用队列按层遍历,遇到叶子结点就返回。 /** * De原创 2016-07-06 17:20:59 · 259 阅读 · 0 评论 -
112. 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. For example: Given the below binary tree and sum原创 2016-07-06 16:50:27 · 263 阅读 · 0 评论 -
172. Factorial Trailing Zeroes
Given an integer n, return the number of trailing zeroes in n!. 求解n!末尾0的个数,实际上就是求n之前所有数分解因子含5的个数。 class Solution { public: int trailingZeroes(int n) { if (n < 5) return 0; in原创 2016-07-06 14:59:02 · 150 阅读 · 0 评论 -
102. 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,null,null,15,7], 3 / \ 9 2原创 2016-07-06 00:43:19 · 210 阅读 · 0 评论 -
14. Longest Common Prefix
Write a function to find the longest common prefix string amongst an array of strings. 寻找最长公共前缀。 思路:先sort排序,再对第0和第n-1项对比即可。 class Solution { public: string longestCommonPrefix(vector &strs) {原创 2016-07-30 11:14:04 · 191 阅读 · 0 评论 -
58. Length of Last Word
Given a string s consists of upper/lower-case alphabets and empty space characters ' ', return the length of last word in the string. If the last word does not exist, return 0. Note: A word is原创 2016-07-20 14:55:21 · 196 阅读 · 0 评论 -
5. Longest Palindromic Substring
Given a string S, find the longest palindromic substring in S. You may assume that the maximum length of S is 1000, and there exists one unique longest palindromic substring. Subscribe to see w原创 2016-09-03 16:18:43 · 347 阅读 · 0 评论 -
188. Best Time to Buy and Sell Stock IV
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 at most k transactions. Note: You may原创 2016-08-11 21:57:45 · 449 阅读 · 0 评论 -
338. Counting Bits
Given a non negative integer number num. For every numbers i in the range 0 ≤ i ≤ num calculate the number of 1's in their binary representation and return them as an array. Example: For num =原创 2016-09-01 10:16:08 · 279 阅读 · 0 评论 -
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 思路:操纵链表节点最好的方式当然是双重指针了。原创 2016-07-21 17:26:07 · 206 阅读 · 0 评论 -
278. First Bad Version
You are a product manager and currently leading a team to develop a new product. Unfortunately, the latest version of your product fails the quality check. Since each version is developed based on the原创 2016-07-31 22:11:17 · 273 阅读 · 0 评论 -
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() -- Get原创 2016-07-31 21:56:30 · 237 阅读 · 0 评论 -
7. Reverse Integer
Reverse digits of an integer. Example1: x = 123, return 321 Example2: x = -123, return -321 思路:反转数字,按位拆解,注意正负号及溢出的问题 class Solution { public: int reverse(int x) { long long res = 0原创 2016-07-31 21:22:13 · 203 阅读 · 0 评论 -
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. Example: Given nums =原创 2016-07-31 19:57:46 · 229 阅读 · 0 评论 -
204. Count Primes
escription: Count the number of prime numbers less than a non-negative number, n. 思路:构造大小为n的布尔型vector存储所有小于n的素数情况,将所有的非素数置为true. class Solution { public: int countPrimes(int n) { if (原创 2016-07-31 19:37:04 · 182 阅读 · 0 评论 -
28. Implement strStr()
Implement strStr(). Returns the index of the first occurrence of needle in haystack, or -1 if needle is not part of haystack. 思路:字符串匹配,返回匹配成功的位置,一是暴力匹配,二是KMP算法。 暴力匹配 class Solution { publi原创 2016-07-31 15:28:39 · 240 阅读 · 0 评论 -
67. Add Binary
Given two binary strings, return their sum (also a binary string). For example, a = "11" b = "1" Return "100". Subscribe to see which companies asked this question 思路:字符串形式“二进制”相加,从低位对应相原创 2016-07-31 14:56:14 · 245 阅读 · 0 评论 -
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 place with原创 2016-07-06 00:02:08 · 176 阅读 · 0 评论 -
118. Pascal's Triangle
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] ] 输出杨辉三角,注意它的生成方法,每个数都是其两肩数原创 2016-07-05 21:37:06 · 202 阅读 · 0 评论 -
70. Climbing Stairs
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? 简单分析一下,到达第n级阶梯有两种方式,从第n-1级走一原创 2016-06-29 21:30:09 · 183 阅读 · 0 评论 -
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原创 2016-06-29 20:37:58 · 191 阅读 · 0 评论 -
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原创 2016-06-29 17:14:56 · 268 阅读 · 0 评论 -
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原创 2016-06-29 16:11:24 · 186 阅读 · 0 评论 -
13. Roman to Integer
Given a roman numeral, convert it to an integer. Input is guaranteed to be within the range from 1 to 3999. 将罗马数字转化为整数,I、V、X、L、C、D和M,分别表示1、5、10、50、100、500和1000 左减右加,利用python字典可以快速遍历迭代求解。 c原创 2016-06-29 13:10:13 · 200 阅读 · 0 评论 -
350. Intersection of Two Arrays II
Given two arrays, write a function to compute their intersection. Example: Given nums1 = [1, 2, 2, 1], nums2 = [2, 2], return [2, 2]. 先排序,然后双指针同时遍历两个数组。 class Solution { public: vector i原创 2016-06-29 12:44:07 · 187 阅读 · 0 评论 -
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原创 2016-06-29 10:53:46 · 179 阅读 · 0 评论 -
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原创 2016-06-29 01:05:59 · 176 阅读 · 0 评论 -
171. Excel Sheet Column Number
Related to question Excel Sheet Column Title Given a column title as appear in an Excel sheet, return its corresponding column number. For example: class Solution { public: int titleToNum原创 2016-06-28 22:11:41 · 261 阅读 · 0 评论 -
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. 两棵树的结构和值都要原创 2016-06-28 21:04:55 · 189 阅读 · 0 评论 -
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 value原创 2016-06-28 20:42:11 · 193 阅读 · 0 评论 -
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 sing原创 2016-06-30 12:06:27 · 191 阅读 · 0 评论 -
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),原创 2016-06-30 13:09:56 · 207 阅读 · 0 评论