LeetCode
该专栏为作者找工作时做过的LeetCode题目及解题思路,如果你正在找互联网工作,一定要去做这个,希望对你有所帮助。
Eastmount
北理本硕,武大博士。欢迎加入“网络攻防和AI安全之家”和“数智人文与文本挖掘”知识星球!自幼受贵州大山的熏陶,养成了诚实质朴的性格。经过寒窗苦读,考入BIT,为完成自己的教师梦,放弃IT、航天等工作,成为贵州高校的一名教师,并想把自己所学所感真心传授给自己的学生,帮助更多陌生人。已发表论文30余篇,撰写专著8部,主持课题6项,感恩遇到的每一位读者,且看且珍惜。
贵州纵美路迢迢,为负劳心此一遭。收得破书三四本,也堪将去教尔曹。娜美人生,醉美生活。他和她经历风雨,慢慢变老。
展开
-
[LeetCode] Length of Last Word - 最后一个单词的长度
题目概述:Length of Last WordGiven 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.最后一个单词的长度原创 2015-09-08 05:08:56 · 6090 阅读 · 0 评论 -
[LeetCode] Count Primes - 素数系列问题
题目概述:Description:Count the number of prime numbers less than a non-negative number, n.题意是给出n中所有素数的个数。参考Sieve of Eratosthenes(埃拉托色尼筛法,简称埃氏筛法),它的思想是通过建立一个bool型数组,从2开始计数,其倍数的数字都赋值为true,显然不是素数。最后统计false的个数即为素数个数。原创 2015-09-21 02:53:05 · 6816 阅读 · 0 评论 -
[LeetCode] Number of 1 Bits & Reverse Integer - 整数问题系列
目录:1.Number of 1 Bits - 计算二进制1的个数 [与运算]2.Contains Duplicate - 是否存在重复数字 [遍历]3.Reverse Integer - 翻转整数 [int边界问题]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原创 2015-09-14 05:15:15 · 6054 阅读 · 0 评论 -
[LeetCode] Move Zeroes - 整数数组处理问题
Move Zeroes - 数组0移到末尾 [顺序交换]题目概述:Given an arraynums, write a function to move all 0's to the end of it while maintaining the relative order of the non-zero elements.For example, givennums = [0, 1, 0, 3, 12], after calling your function,nums should be[1,原创 2015-09-20 20:11:11 · 7618 阅读 · 0 评论 -
[LeetCode] 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.该题意是判断两个字符串s和t是否是同构的,关键代码:nums[s[i]]=t[i] numt[t[i]]=s[i] 再比较是否相同 。原创 2015-09-21 01:14:30 · 5618 阅读 · 0 评论 -
[LeetCode] Reverse Linked List I II - 链表翻转问题
[LeetCode] Reverse Linked List I II - 链表翻转问题题目概述:Reverse a singly linked list.翻转一个单链表,如:1->2 输出 2->1;1->2->3 输出3->2->1。题目解析:第二种方法更为推荐——直接翻转,还有一种递归方法自行提高。如下图所示,红色表示初始链表存在4个值[1, 2, 3, 4],蓝色表示初始指针first指向第一个元素、second指向第二个元素(head->next),third指向第三个元素;首先s->n原创 2015-09-14 19:09:56 · 5841 阅读 · 1 评论 -
[LeetCode] Valid Anagram - 字符串排序比较系列
题目概述:字符串处理类型主要讲述sort排序方法和计算字母个数的方法Given two strings s and t, write a function to determine if t is an anagram of s.For example,s = "anagram", t = "nagaram", return true.s = "rat", t = "car", return false.原创 2015-09-14 07:01:49 · 5846 阅读 · 0 评论 -
[LeetCode] Invert Binary Tree - 二叉树翻转系列问题
目录:Binary Tree Level Order Traversal - 二叉树层次遍历 BFS题目背景是MaxHowell(他是苹果电脑最受欢迎的homebrew程序作者)去Google面试,面试官说:“虽然在Google有90%的工程师用你写的Homebrew,但是你居然不能再白板上写出翻转二叉树的代码,所以滚带吧”!原创 2015-09-12 05:33:35 · 6234 阅读 · 0 评论 -
[LeetCode] Binary Tree Level Order Traversal 二叉树层次遍历(DFS | BFS)
题目:Binary Tree Level Order Traversal - 二叉树层次遍历 (DFS | BFS)Given a binary tree, return the level order traversal of its nodes' values. (ie, from left to right, level by level).For example:Given binary tree {3,9,20,#,#,15,7},原创 2015-09-11 02:20:37 · 8697 阅读 · 0 评论 -
[LeetCode] Binary Tree Paths - 二叉树基础系列题目
题目概述:Binary Tree Paths - 二叉树路径Given a binary tree, return all root-to-leaf paths.For example, given the following binary tree:希望文章对你有所帮助~原创 2015-09-09 00:58:21 · 6636 阅读 · 1 评论 -
[LeetCode] Remove Duplicates from Sorted List - 链表问题
题目概述:Given a sorted linked list, delete all duplicates such that each element appear only once.For example,Given 1->1->2, return 1->2.Given 1->1->2->3->3, return 1->2->3.这是一道非常简单的链表,题意是删除单链表(已排序)中的重复数字原创 2015-09-10 03:33:30 · 5274 阅读 · 0 评论 -
[LeetCode] Plus One - 整数字符转换相加
题目概述: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.PS:需要注意转换方法 ((a[i]-'0')+(b[j]-'0')+add)%2+'0'当前结果和 进位数字add=((原创 2015-09-09 05:19:20 · 7441 阅读 · 0 评论 -
[LeetCode] First Bad Version - 二分查找
题目概述:First Bad Version - 二分查找 最后一个坏的版本You are a product manager and currently leading a team to develop a new product. Unfortunately, the latest version of your product fails the quality check. Since each version is developed bas原创 2015-09-09 02:16:49 · 5308 阅读 · 0 评论 -
[LeetCode] Add Digits - 数字各个位数求和
题目概述:Add Digits 数字各个位数求和Given a non-negative integer num, repeatedly add all its digits until the result has only one digit.For example:Given num = 38, the process is like: 3 + 8 = 11, 1 + 1 = 2. Since 2 has only原创 2015-09-08 18:06:18 · 7028 阅读 · 1 评论 -
[LeetCode] Palindrome Number & Valid Palindrome - 回文系列问题
题目概述:Determine whether an integer is a palindrome. Do this without extra space.判断数字是否是回文 例如121、656、3443 方法有很多,正着看和到着看两数相同;当然负数显然不是回文判读一个字符串是否是回文,一种方法可以将字符串倒置然后和原字符串进行比较。这里采用一种类似字符串翻转的方法,通过从前后两个方向来比较判断是否是回文。原创 2015-09-24 02:48:07 · 5663 阅读 · 0 评论