leetcode
文章平均质量分 55
Frankfurta
低头要有勇气,抬头要有底气。要么尽情学习,要么放肆运动,要么勇敢去爱,混乱迷惘不是真正的你!
展开
-
LeetCode之2. Add Two Numbers
问题描述You are given two non-empty linked lists representing two non-negative integers. The digits are stored in reverse order and each of their nodes contain a single digit. Add the two numbers and retur原创 2017-08-14 16:07:58 · 362 阅读 · 0 评论 -
IntegerToRoman
自己写的def romanToInt(s): M = ["", "M", "MM", "MMM"] C = ["", "C", "CC", "CCC", "CD", "D", "DC", "DCC", "DCCC", "CM"] X = ["", "X", "XX", "XXX", "XL", "L", "LX", "LXX", "LXXX", "XC"] I = [原创 2017-11-16 11:27:57 · 183 阅读 · 0 评论 -
3Sum
输入一个列表,输出列表中任意三个数相加为零的集合 res = [] nums = sorted(nums) for i in range(0, len(nums) - 1): if i > 0 and nums[i] == nums[i - 1]: continue j = i + 1 k = len(nu原创 2017-11-20 20:47:49 · 188 阅读 · 0 评论 -
反转整形数
能通过的def reverse(x): tmp = int(''.join(list(list(str(abs(x)))[::-1]))) if x >= 0: ans = tmp else: ans = -tmp if (ans > 2 ** 31 - 1) or (ans < -2 ** 31): return 0原创 2017-11-05 22:11:26 · 218 阅读 · 0 评论 -
Longest Common Prefix
自己写的==思路很简单,首先设置好i,j,其中i是用来表示列表中字符串的序号,j使用来表示字符串中的序号,如果两两字符串相等,那么j+1接着比较下一个字符,如果两两字符不相等,则输出当前的前缀字符串。 ==Time complexity : O(S) , where S is the sum of all characters in all strings.,空间复杂度O(1),时间复杂度我想应该原创 2017-11-18 21:09:59 · 183 阅读 · 0 评论 -
求最长回文串
之前写的很复杂,以后从简从精import numpy as npclass Solution(object): def longestPalindrome(self, s): """ :type s: str :rtype: str """ maxlen, start, stop = 0, 0, 0转载 2017-11-04 11:23:35 · 149 阅读 · 0 评论 -
regular expression matching --python
递归def isMatch(s, p): if not p: return not s if len(p) == 1 or p[1] != '*': return len(s) > 0 and (p[0] == '.' or s[0] == p[0]) and isMatch(s[1:], p[1:]) while s and (p[0] ==原创 2017-11-10 21:20:48 · 321 阅读 · 0 评论 -
LeetCode之3. Longest Substring Without Repeating Characters
LeetCode上给的解决办法尝试 #1 暴力方法思考 一个个查看所有的子字符串看看是否没有相同的字符 算法 ——假设我们有一个函数,boolean allUnique(String substring),这个函数在String的每个子字符串中的字符都是两两不同的时候返回True。我们可以迭代字符串S中的所有子字符串并调用allUnique这个函数。如果返回True的话,我们就更新不原创 2017-08-31 21:11:18 · 372 阅读 · 1 评论 -
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 same原创 2017-08-08 22:14:40 · 343 阅读 · 0 评论 -
求助同一道leetcode,C++出现溢出而python不会出现溢出,Why?
Solution {public:int guessNumber(int n) {int low = 0,high = n,mid;while(low&lt;=high){mid = low + (high-low)/2;//不发生溢出//mid = (low + high)/2; //发生溢出if(guess(mid)==-1){high = mid -1;}else if(...原创 2018-11-09 23:47:22 · 302 阅读 · 1 评论