
leetcode
YuYunTan
只是一个学习的初步者
展开
-
leetcode编程题(1)Two Sum
导言题目原题目题目中文翻译解析代码测试的代码运行结果导言leetcode是一个判断型的OJ,拥有大量的算法题目,最近拿来练手题目(原题目)Given an array of integers, return indices of the two numbers such that they add up to a specific target.You may assume that e原创 2016-04-10 19:20:16 · 967 阅读 · 2 评论 -
leetcode编程题(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原创 2016-04-10 21:13:33 · 1578 阅读 · 2 评论 -
leetcode编程题(3)Longest Substring Without Repeating Characters
题目英文原版题目中文翻译版解析算法测试代码运行结果题目(英文原版)Given a string, find the length of the longest substring without repeating characters. For example, the longest substring without repeating letters for “abcabcbb”原创 2016-04-10 22:54:09 · 948 阅读 · 2 评论 -
leetcode编程题(4)Median of Two Sorted Arrays
题目英文版题目中文翻译版解析算法测试代码测试结果题目(英文版)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 (原创 2016-04-11 13:36:49 · 1238 阅读 · 0 评论 -
leetcode编程题(5)Longest Palindromic Substring(最长回文子串)【最全解法】
文章目录Longest Palindromic Substring(最长回文子串)【最全解法】题目(英文版)题目(中文翻译版)题目解析方法一: 最长公共子串法思路最大公共子串(动态规划)思路算法复杂度算法代码会超时线下没问题的该算法代码改进并通过的代码方法二:镜像中心扩展方法思路算法复杂度算法代码方法三:暴力法思路算法复杂度算法代码会超时无法通过的暴力破解改进的可通过的暴力法方法四:动态规划思路算...原创 2018-11-18 17:25:10 · 910 阅读 · 2 评论