李晓磊
码龄14年
求更新 关注
提问 私信
  • 博客:19,781
    19,781
    总访问量
  • 59
    原创
  • 5
    粉丝
  • 20
    关注
IP属地以运营商信息为准,境内显示到省(区、市),境外显示到国家(地区)
IP 属地:河北省
加入CSDN时间: 2011-08-03
博客简介:

enjoy_lilei的专栏

查看详细资料
个人成就
  • 获得0次点赞
  • 内容获得2次评论
  • 获得1次收藏
  • 博客总排名1,706,962名
创作历程
  • 2篇
    2018年
  • 56篇
    2015年
  • 1篇
    2014年
成就勋章
TA的专栏
  • LeetCode
    58篇

TA关注的专栏 0

TA关注的收藏夹 0

TA关注的社区 0

TA参与的活动 0

创作活动更多

新星杯·14天创作挑战营·第13期

这是一个以写作博客为目的的创作活动,旨在鼓励大学生博主们挖掘自己的创作潜能,展现自己的写作才华。如果你是一位热爱写作的、想要展现自己创作才华的小伙伴,那么,快来参加吧!我们一起发掘写作的魅力,书写出属于我们的故事。我们诚挚邀请你们参加为期14天的创作挑战赛!注: 1、参赛者可以进入活动群进行交流、互相鼓励与支持(开卷),虚竹哥会分享创作心得和涨粉心得,答疑及活动群请见:https://bbs.csdn.net/topics/619781944 【进活动群,得奖概率会更大,因为有辅导】 2、文章质量分查询:https://www.csdn.net/qc

90人参与 去参加
  • 最近
  • 文章
  • 专栏
  • 代码仓
  • 资源
  • 收藏
  • 关注/订阅/互动
更多
  • 最近

  • 文章

  • 专栏

  • 代码仓

  • 资源

  • 收藏

  • 关注/订阅/互动

  • 社区

  • 帖子

  • 问答

  • 课程

  • 视频

搜索 取消

modern_operating_systems_3rd_edition

发布资源 2014.10.12 ·
pdf

【LeetCode】141. Linked List Cycle

问题 Given a linked list, determine if it has a cycle in it. To represent a cycle in the given linked list, we use an integer pos which represents the position (0-indexed) in the linked list where tail ...
原创
博文更新于 2018.12.09 ·
181 阅读 ·
0 点赞 ·
0 评论 ·
0 收藏

【LeetCode】136. Single Number

【LeetCode】136. Single Number 问题思路常规解法基于比特操作的解法知识点比特位操作 问题 Given a non-empty array of integers, every element appears twice except for one. Find that single one. Note: Your algorithm should have a line...
原创
博文更新于 2018.12.09 ·
179 阅读 ·
0 点赞 ·
0 评论 ·
0 收藏

【LeetCode】017.Letter Combinations of a Phone Number

题目: Given a digit string, return all possible letter combinations that the number could represent. A mapping of digit to letters (just like on the telephone buttons) is given below. Input
原创
博文更新于 2015.07.03 ·
391 阅读 ·
0 点赞 ·
0 评论 ·
0 收藏

【LeetCode】016.3Sum Closest

题目: Given an array S of n integers, find three integers in S such that the sum is closest to a given number, target. Return the sum of the three integers. You may assume that each input would hav
原创
博文更新于 2015.07.03 ·
355 阅读 ·
0 点赞 ·
0 评论 ·
0 收藏

【LeetCode】015.3Sum

题目: Given an array S of n integers, are there elements a, b, c in S such that a + b + c = 0? Find all unique triplets in the array which gives the sum of zero. Note: Elements in a tripl
原创
博文更新于 2015.05.20 ·
405 阅读 ·
0 点赞 ·
0 评论 ·
0 收藏

【LeetCode】012.Integer to Roman

题目: Given an integer, convert it to a roman numeral. Input is guaranteed to be within the range from 1 to 3999. 解答: 从千位到个位,根据位数不同选择不同的字母,char1,char5,char10分别代表该位表示1,5和10的字母。 c为当前位数字(0---9),
原创
博文更新于 2015.05.20 ·
393 阅读 ·
0 点赞 ·
0 评论 ·
0 收藏

【LeetCode】011.Container With Most Water

题目: Given n non-negative integers a1, a2, ..., an, where each represents a point at coordinate (i, ai). n vertical lines are drawn such that the two endpoints of line i is at (i, ai) and (i,
原创
博文更新于 2015.05.20 ·
314 阅读 ·
0 点赞 ·
0 评论 ·
0 收藏

【LeetCode】005.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. 解答: 典型动态规划
原创
博文更新于 2015.05.19 ·
308 阅读 ·
0 点赞 ·
0 评论 ·
0 收藏

【LeetCode】003.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" is "abc", which the length is
原创
博文更新于 2015.05.19 ·
434 阅读 ·
0 点赞 ·
0 评论 ·
0 收藏

【LeetCode】002.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
原创
博文更新于 2015.05.19 ·
747 阅读 ·
0 点赞 ·
0 评论 ·
0 收藏

【LeetCode】001.Two Sum

题目: Given an array of integers, find two numbers such that they add up to a specific target number. The function twoSum should return indices of the two numbers such that they add up to the ta
原创
博文更新于 2015.05.19 ·
365 阅读 ·
0 点赞 ·
0 评论 ·
0 收藏

【LeetCode】206.reverse linked list

题目: Reverse a singly linked list. 解答: 关键是弄明白next到底指向哪个元素; 代码: /** * Definition for singly-linked list. * public class ListNode { * int val; * ListNode next; * ListNode(int x) {
原创
博文更新于 2015.05.11 ·
247 阅读 ·
0 点赞 ·
0 评论 ·
0 收藏

【LeetCode】205.Isomorphic Strings

题目: Given two strings s and t, determine if they are isomorphic. Two strings are isomorphic if the characters in s can be replaced to get t. All occurrences of a character must be replaced
原创
博文更新于 2015.05.11 ·
384 阅读 ·
0 点赞 ·
0 评论 ·
0 收藏

【LeetCode】204.Count Primes

题目: Description: Count the number of prime numbers less than a non-negative number, n click to show more hints. Credits: Special thanks to @mithmatt for adding this problem and creating
原创
博文更新于 2015.05.11 ·
319 阅读 ·
0 点赞 ·
0 评论 ·
0 收藏

【LeetCode】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 解答: 使用2个指针,一个指向当
原创
博文更新于 2015.05.11 ·
292 阅读 ·
0 点赞 ·
0 评论 ·
0 收藏

【LeetCode】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 th
原创
博文更新于 2015.05.11 ·
325 阅读 ·
0 点赞 ·
0 评论 ·
0 收藏

【LeetCode】198.House Robber

题目: You are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed, the only constraint stopping you from robbing each of them is that adjac
原创
博文更新于 2015.05.11 ·
308 阅读 ·
0 点赞 ·
0 评论 ·
0 收藏

【LeetCode】189.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]. Note: Try to come up as many soluti
原创
博文更新于 2015.05.08 ·
390 阅读 ·
0 点赞 ·
0 评论 ·
0 收藏

【LeetCode】172.Factorial Trailing Zeroes

题目: Given an integer n, return the number of trailing zeroes in n!. Note: Your solution should be in logarithmic time complexity. 解答: 对n!进行质因数分解n!=2^x * 3^y * 5^z * .....,容易看出,n!尾部零的数量
原创
博文更新于 2015.05.07 ·
304 阅读 ·
0 点赞 ·
0 评论 ·
0 收藏
加载更多