leetcode
文章平均质量分 84
feng_blog6688
这个作者很懒,什么都没留下…
展开
-
String to Integer (atoi)
Implement the myAtoi(string s) function, which converts a string to a 32-bit signed integer (similar to C/C++'s atoi function).The algorithm for myAtoi(string s) is as follows:Read in and ignore any leading whitespace.Check if the next character (if not原创 2021-12-24 13:14:05 · 135 阅读 · 0 评论 -
Leetcode 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() -- Return whet原创 2015-07-13 17:21:42 · 370 阅读 · 0 评论 -
Leetcode Summary Ranges
Given a sorted integer array without duplicates, return the summary of its ranges.For example, given [0,1,2,4,5,7], return ["0->2","4->5","7"].从第一个元素开始,找到连续的子序列,保存在string类型的变量里。class Solution原创 2015-07-10 15:02:45 · 319 阅读 · 0 评论 -
Leetcode 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./** * Definition for a binary tree原创 2015-05-26 09:54:35 · 373 阅读 · 0 评论 -
Leetcode 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]]杨辉三角的特点class Solutio原创 2015-05-25 09:49:35 · 308 阅读 · 0 评论 -
Leetcode LRU Cache
Design and implement a data structure for Least Recently Used (LRU) cache. It should support the following operations: get and set.get(key) - Get the value (will always be positive) of the key if原创 2015-06-07 16:52:48 · 356 阅读 · 0 评论 -
Leetcode Kth Largest Element in an Array
Find the kth largest element in an unsorted array. Note that it is the kth largest element in the sorted order, not the kth distinct element.For example,Given [3,2,1,5,6,4] and k = 2, return 5原创 2015-05-23 16:43:25 · 307 阅读 · 0 评论 -
Leetcode Longest Common Prefix
Write a function to find the longest common prefix string amongst an array of strings.题意是写一个函数,找到字符串最大相同的前缀。首先以第一个字符串的子串作为参考,依次和其它字符串子串比较,如果相同,则继续,不同则返回上一次的参考子串。class Solution {public: stri原创 2015-05-23 16:30:17 · 261 阅读 · 0 评论 -
Leetcode Pow(x, n)
Implement pow(x, n).题目是很简单,就是求x的n次方,但是提交的时候很费劲,TLE,超时,主要考虑一些条件问题:1、result 2、x = 1 或者-1的时候,返回值根据n的奇偶情况返回1或者-13、n = 0的情况,返回值1.4、n不能直接累积,肯定会超时,因此要成倍的累积。class Solution {public: double myPo原创 2015-05-23 09:35:46 · 273 阅读 · 0 评论 -
Leetcode 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-05-22 20:21:50 · 280 阅读 · 0 评论 -
Leetcode 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原创 2015-05-22 10:46:02 · 303 阅读 · 0 评论 -
Leetcode 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 as0011100101原创 2015-05-22 20:46:24 · 363 阅读 · 0 评论 -
Leetcode 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-06-01 20:09:29 · 354 阅读 · 0 评论 -
Leetcode 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 9534330.Note: The result may be ve原创 2015-08-08 21:05:43 · 373 阅读 · 0 评论 -
Leetcode 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.原创 2015-07-15 16:34:00 · 294 阅读 · 0 评论 -
Non-decreasing Array 非递减数列
#include <iostream>#include <vector>using namespace std;class Solution {public: bool checkPossibility(vector<int>& nums) { int nCur = 1; bool bRet = true; i...原创 2018-09-26 17:00:15 · 213 阅读 · 0 评论 -
多个有序的链表合并
/** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * ListNode(int x) : val(x), next(NULL) {} * }; */class Solution {public: ListNode* m...原创 2018-09-25 11:12:31 · 598 阅读 · 0 评论 -
Leetcode 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原创 2015-09-27 09:50:02 · 516 阅读 · 0 评论 -
Leetcode Peeking Iterator
Given an Iterator class interface with methods: next() and hasNext(), design and implement a PeekingIterator that support the peek() operation -- it essentially peek() at the element that will be原创 2015-09-25 09:37:43 · 363 阅读 · 0 评论 -
Leetcode Next Permutation
Implement next permutation, which rearranges numbers into the lexicographically next greater permutation of numbers.If such arrangement is not possible, it must rearrange it as the lowest possible原创 2015-07-25 12:40:34 · 274 阅读 · 0 评论 -
Leetcode Unique Paths
A robot is located at the top-left corner of a m x n grid (marked 'Start' in the diagram below).The robot can only move either down or right at any point in time. The robot is trying to reach the原创 2015-08-28 10:18:15 · 324 阅读 · 0 评论 -
Leetcode 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 v原创 2015-07-21 14:20:09 · 299 阅读 · 0 评论 -
Leetcode Partition List
Given a linked list and a value x, partition it such that all nodes less than x come before nodes greater than or equal to x.You should preserve the original relative order of the nodes in each of原创 2015-08-27 18:18:53 · 265 阅读 · 0 评论 -
Leetcode Balanced Binary Tree
Given a binary tree, determine if it is height-balanced.For this problem, a height-balanced binary tree is defined as a binary tree in which the depth of the two subtrees of every node never diffe原创 2015-07-31 10:06:24 · 307 阅读 · 0 评论 -
Leetcode Subsets
Given a set of distinct integers, nums, return all possible subsets.Note:Elements in a subset must be in non-descending order.The solution set must not contain duplicate subsets.For原创 2015-07-17 10:13:20 · 301 阅读 · 0 评论 -
Leetcode Sum Root to Leaf Numbers
Given a binary tree containing digits from 0-9 only, each root-to-leaf path could represent a number.An example is the root-to-leaf path 1->2->3 which represents the number 123.Find the tota原创 2015-07-15 16:58:03 · 258 阅读 · 0 评论 -
Leetcode Sort List
Sort a linked list in O(n log n) time using constant space complexity.单链表排序问题,下面用插入排序的方法。/** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; *原创 2015-08-09 16:47:20 · 278 阅读 · 0 评论 -
Leetcode 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].数组的旋转问题,需要找到每一个位置对应旋转之后的位置,保存为 itoj 数组,然后需要申请原创 2015-05-22 21:53:44 · 346 阅读 · 0 评论 -
Leetcode Max Points on a Line
Given n points on a 2D plane, find the maximum number of points that lie on the same straight line.题意是给定N个点,找到共线的点最多有多少个,求固定一个点points[i],求points[i]与points[j]之间的斜率,统计斜率出现的次数,注意斜率不存在的情况。/** * Def原创 2015-06-02 12:32:02 · 348 阅读 · 0 评论 -
Leetcode Linked List Cycle
Given a linked list, determine if it has a cycle in it.使用两个指针,一前一后,(p,q),p与q相差一个位置,之后p移动一步,q相对应移动两步,如果存在环,那么q和p一定会相遇/** * Definition for singly-linked list. * struct ListNode { * int val;原创 2015-05-29 22:07:52 · 350 阅读 · 0 评论 -
Leetcode Implement strStr()
Implement strStr().Returns the index of the first occurrence of needle in haystack, or -1 if needle is not part of haystack.class Solution {public: int strStr(string haystack, string need原创 2015-05-29 09:54:32 · 274 阅读 · 0 评论 -
Leetcode Remove Nth Node From End of List
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 from the end, t原创 2015-05-17 10:36:26 · 185 阅读 · 0 评论 -
Leetcode Integer to Roman
Given an integer, convert it to a roman numeral.Input is guaranteed to be within the range from 1 to 3999.题目意思:罗马数字转换成数字形式,第一次提交的时候出现超时,class Solution {public: string intToRoman(int n原创 2015-05-17 19:31:07 · 240 阅读 · 0 评论 -
leetcode Excel Sheet Column Title
Given a positive integer, return its corresponding column title as appear in an Excel sheet.For example: 1 -> A 2 -> B 3 -> C ... 26 -> Z 27 -> AA 28 -> AB class Sol原创 2015-05-14 19:50:02 · 263 阅读 · 0 评论 -
Leetcode Plus One
Given a non-negative number represented as an array of digits, plus one to the number.The digits are stored such that the most significant digit is at the head of the list.给定非负数组,表示整型数值,对整型数组加原创 2015-05-16 11:14:02 · 290 阅读 · 0 评论 -
Leetcode 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?爬楼梯问题,每一次可以爬1阶或者2阶,问爬上N阶的选择法原创 2015-05-16 19:03:39 · 278 阅读 · 0 评论 -
Leetcode Count Primes
Description:Count the number of prime numbers less than a non-negative number, n题目意思就是统计1~n之间有多少素数。C语言教程中提到一种求素数的方法,如果X不能被2~sqrt(x)之间的数整除,则x是素数,但是这样会出现time limit out,超时,接下来要优化这种方法,就是记录已经找到原创 2015-05-17 15:06:44 · 212 阅读 · 0 评论 -
leetcode Excel Sheet Column Number
和罗马数字转化成阿拉伯数字一样,注意是26进制的,使用map映射class Solution {public: int titleToNumber(string s) { map sheetset; int sum = 0; for(int i=0; i { sheetset['A'原创 2015-05-14 17:18:52 · 228 阅读 · 0 评论 -
Path Sum II
Given a binary tree and a sum, find all root-to-leaf paths where each path's sum equals the given sum.For example:Given the below binary tree and sum = 22, 5 / \原创 2015-05-15 21:58:50 · 305 阅读 · 0 评论 -
Leetcode 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 no原创 2015-05-16 15:28:45 · 421 阅读 · 0 评论