leetcode
HxShine
这个作者很懒,什么都没留下…
展开
-
2. Add Two Numbers(链表加法)
题目 You are given two linked lists representing two non-negative numbers. The digits are stored in reverse order and each of their nodes contain a single digit. Add the two numbers and return it as a l原创 2016-09-13 13:28:31 · 330 阅读 · 0 评论 -
leetcode 155. Min Stack
https://leetcode.com/problems/min-stack/#/description Design a stack that supports push, pop, top, and retrieving the minimum element in constant time.push(x) – Push element x onto stack. pop() – Rem原创 2017-04-06 00:32:43 · 527 阅读 · 0 评论 -
4. Median of Two Sorted Arrays(hard)(lg(n+m),可以转化为求俩组数合并后第k个元素,通过递归去掉前面一部分不可能为第k个元素的一组数来实现)
官网There are two sorted arrays nums1 and nums2 of size m and n respectively.Find the median of the two sorted arrays. The overall run time complexity should be O(log (m+n)).Example 1: nums1 = [1, 3] n原创 2016-09-18 13:14:34 · 364 阅读 · 0 评论 -
9. Palindrome Number(判断一个整数是否为回文数)
官网Determine whether an integer is a palindrome. Do this without extra space.click to show spoilers.Some hints: Could negative integers be palindromes? (ie, -1)If you are thinking of converting the int原创 2016-09-19 11:12:15 · 804 阅读 · 0 评论 -
8. String to Integer (atoi)(将输入的字符串转化为整数)
官网Implement atoi to convert a string to an integer.Hint: Carefully consider all possible input cases. If you want a challenge, please do not see below and ask yourself what are the possible input cases原创 2016-09-19 10:29:57 · 529 阅读 · 0 评论 -
7. Reverse Integer(整数反转,注意超范围记为0)
官网Reverse digits of an integer.Example1: x = 123, return 321 Example2: x = -123, return -321注意事项 1.while(只要不为零就继续窝槽),负数也可以直接用了。 AC代码#include<vector> #include<string> #include<iostream> #includ原创 2016-09-18 21:49:27 · 355 阅读 · 0 评论 -
6. ZigZag Conversion(Z字形输出数组)
官网The string “PAYPALISHIRING” is written in a zigzag pattern on a given number of rows like this: (you may want to display this pattern in a fixed font for better legibility)P A H N A P L S I I原创 2016-09-18 20:55:18 · 465 阅读 · 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 which co原创 2016-09-18 15:04:40 · 183 阅读 · 0 评论 -
3. Longest Substring Without Repeating Characters(求最长的不重复的连续的子序列。)
官网Given a string, find the length of the longest substring without repeating characters.Examples:Given “abcabcbb”, the answer is “abc”, which the length is 3.Given “bbbbb”, the answer is “b”, with the原创 2016-09-13 15:26:14 · 490 阅读 · 0 评论 -
刷题笔记
5.24 https://discuss.leetcode.com/topic/3294/accepted-c-o-n-solution原创 2017-05-24 00:04:53 · 444 阅读 · 0 评论