程序员面试金典
文章平均质量分 57
Bryan要加油
这个作者很懒,什么都没留下…
展开
-
面试题 10.02. 变位词组[Medium](Leetcode每日一题-2021.07.18)
Problem编写一种方法,对字符串数组进行排序,将所有变位词组合在一起。变位词是指字母相同,但排列不同的字符串。说明:所有输入均为小写字母。不考虑答案输出的顺序。Example输入: [“eat”, “tea”, “tan”, “ate”, “nat”, “bat”],输出:[[“ate”,“eat”,“tea”],[“nat”,“tan”],[“bat”]]Solutionclass Solution {public: vector<vector<原创 2021-07-18 22:40:55 · 141 阅读 · 0 评论 -
面试题 16.11. Diving Board LCCI(Leetcode每日一题-2020.07.08)
ProblemYou are building a diving board by placing a bunch of planks of wood end-to-end. There are two types of planks, one of length shorter and one of length longer. You must use exactly K planks of wood. Write a method to generate all possible lengths f原创 2020-07-08 20:32:17 · 404 阅读 · 0 评论 -
面试题 16.18. Pattern Matching LCCI(Leetcode每日一题-2020.06.22)
ProblemYou are given two strings, pattern and value. The pattern string consists of just the letters a and b, describing a pattern within a string. For example, the string catcatgocatgo matches the pattern aabab (where cat is a and go is b). It also match原创 2020-06-22 22:39:03 · 267 阅读 · 0 评论 -
142. Linked List Cycle II&面试题 02.08. Linked List Cycle LCCI
占坑原创 2020-05-06 23:26:10 · 198 阅读 · 0 评论 -
面试题 02.04. Partition List LCCI
ProblemWrite code to partition a linked list around a value x, such that all nodes less than x come before all nodes greater than or equal to x. If x is contained within the list, the values of x onl...原创 2020-05-06 21:17:23 · 185 阅读 · 0 评论 -
160. Intersection of Two Linked Lists&面试题52. 两个链表的第一个公共节点&面试题 02.07. Intersection of Two Linked List
ProblemWrite a program to find the node at which the intersection of two singly linked lists begins.Example1A and B intersect at c1Example2A and B has not intersection.Solution/** * Definiti...原创 2020-05-05 22:14:44 · 241 阅读 · 0 评论 -
面试题 08.11. Coin LCCI(Leetcode每日一题-2020.04.23)
占坑原创 2020-04-23 19:08:23 · 219 阅读 · 0 评论 -
48. Rotate Image&&面试题 01.07. Rotate Matrix LCCI(Leetcode每日一题-2020.04.07)
ProblemGiven an image represented by an N x N matrix, where each pixel in the image is 4 bytes, write a method to rotate the image by 90 degrees. Can you do this in place?ExampleGiven matrix =[[...原创 2020-04-07 23:21:47 · 337 阅读 · 0 评论 -
47. Permutations II && 面试题 08.08. Permutation II LCCI && 面试题38. 字符串的排列
Problem47Given a collection of numbers that might contain duplicates, return all possible unique permutations.ExampleInput: [1,1,2]Output:[[1,1,2],[1,2,1],[2,1,1]]面试题08.08Write a method ...原创 2020-03-29 17:21:57 · 247 阅读 · 0 评论 -
46. Permutations&&面试题 08.07. Permutation I LCCI(Leetcode每日一题-2020.04.25)
Problem46Given a collection of distinct integers, return all possible permutations.ExampleInput: [1,2,3]Output:[[1,2,3],[1,3,2],[2,1,3],[2,3,1],[3,1,2],[3,2,1]]来源:力扣(LeetCode)链接:https...原创 2020-03-29 17:12:33 · 291 阅读 · 0 评论 -
155. Min Stack&&面试题 03.02. Min Stack LCCI(Leetcode每日一题-2020.05.12)
ProblemHow would you design a stack which, in addition to push and pop, has a function min which returns the minimum element? Push, pop and min should all operate in 0(1) time.ExampleMinStack minS...原创 2020-03-26 22:43:30 · 233 阅读 · 0 评论 -
面试题 03.01. Three in One LCCI
ProblemDescribe how you could use a single array to implement three stacks.Yout should implement push(stackNum, value)、pop(stackNum)、isEmpty(stackNum)、peek(stackNum) methods. stackNum is the index o...原创 2020-03-26 22:30:26 · 252 阅读 · 0 评论 -
面试题 02.06. Palindrome Linked List LCCI
ProblemImplement a function to check if a linked list is a palindrome.Example1Input: 1->2Output: falseExample2Input: 1->2->2->1Output: trueSolution/** * Definition for si...原创 2020-03-25 22:16:46 · 215 阅读 · 0 评论 -
面试题 02.01. Remove Duplicate Node LCCI
ProblemWrite code to remove duplicates from an unsorted linked list.Example1Input: [1, 2, 3, 3, 2, 1]Output: [1, 2, 3]Example2Input: [1, 2, 3, 3, 2, 1]Output: [1, 2, 3]Solution用一个set辅助记录出...原创 2020-03-25 22:00:48 · 210 阅读 · 0 评论 -
面试题 01.09. String Rotation LCCI
ProblemGiven two strings, s1 and s2, write code to check if s2 is a rotation of s1 (e.g.,“waterbottle” is a rotation of"erbottlewat"). Can you use only one call to the method that checks if one word ...原创 2020-03-24 23:48:20 · 228 阅读 · 0 评论 -
面试题 01.04. Palindrome Permutation LCCI
ProblemGiven a string, write a function to check if it is a permutation of a palin drome. A palindrome is a word or phrase that is the same forwards and backwards. A permutation is a rearrangement o...原创 2020-03-24 23:34:12 · 224 阅读 · 0 评论 -
面试题 01.03. String to URL LCCI
ProblemWrite a method to replace all spaces in a string with ‘%20’. You may assume that the string has sufficient space at the end to hold the additional characters,and that you are given the “true” ...原创 2020-03-24 23:27:32 · 162 阅读 · 0 评论 -
面试题 17.16. The Masseuse LCCI(Leetcode每日一题-2020.03.24)
ProblemA popular masseuse receives a sequence of back-to-back appointment requests and is debating which ones to accept. She needs a break between appointments and therefore she cannot accept any adj...原创 2020-03-24 23:17:19 · 722 阅读 · 0 评论 -
面试题 01.02. Check Permutation LCCI
ProblemGiven two strings,write a method to decide if one is a permutation of the other.Note:0 <= len(s1) <= 1000 <= len(s2) <= 100Example1Input: s1 = “abc”, s2 = “bca”Output: true...原创 2020-03-23 23:26:24 · 175 阅读 · 0 评论 -
面试题 01.01. Is Unique LCCI
ProblemImplement an algorithm to determine if a string has all unique characters. What if you cannot use additional data structures?Example1Input: s = “leetcode”Output: falseExample2Input: s ...原创 2020-03-23 23:22:05 · 259 阅读 · 0 评论 -
面试题 03.04. Implement Queue using Stacks LCCI
ProblemImplement a MyQueue class which implements a queue using two stacks.Notes:You must use only standard operations of a stack – which means only push to top, peek/pop from top, size, and is em...原创 2020-03-23 23:15:53 · 200 阅读 · 0 评论 -
面试题 02.03. Delete Middle Node LCCI
ProblemImplement an algorithm to delete a node in the middle (i.e., any node but the first and last node, not necessarily the exact middle) of a singly linked list, given only access to that node.Ex...原创 2020-03-23 23:00:17 · 214 阅读 · 0 评论 -
面试题 02.02. Kth Node From End of List LCCI&面试题22. 链表中倒数第k个节点
ProblemImplement an algorithm to find the kth to last element of a singly linked list. Return the value of the element.Note:k is always valid.This problem is slightly different from the original ...原创 2020-03-23 22:47:35 · 183 阅读 · 0 评论 -
面试题 01.06. Compress String LCCI(Leetcode每日一题-2020.03.16)
ProblemImplement a method to perform basic string compression using the counts of repeated characters. For example, the string aabcccccaaa would become a2blc5a3. If the “compressed” string would not ...原创 2020-03-16 19:30:26 · 226 阅读 · 0 评论 -
98. Validate Binary Search Tree &&面试题 04.05. Legal Binary Search Tree LCCI(Leetcode每日一题-2020.05.05)
ProblemGiven a binary tree, determine if it is a valid binary search tree (BST).Assume a BST is defined as follows:The left subtree of a node contains only nodes with keys less than the node’s key....原创 2020-03-11 23:45:19 · 186 阅读 · 0 评论 -
236. Lowest Common Ancestor of a Binary Tree&&面试题68&&面试题 04.08(Leetcode每日一题-2020.05.10)
#ProblemGiven a binary tree, find the lowest common ancestor (LCA) of two given nodes in the tree.According to the definition of LCA on Wikipedia: “The lowest common ancestor is defined between two ...原创 2020-02-24 23:24:21 · 245 阅读 · 0 评论 -
面试题 04.06. Successor LCCI
ProblemWrite an algorithm to find the “next” node (i.e., in-order successor) of a given node in a binary search tree.Return null if there’s no “next” node for the given node.Example1Example2Sol...原创 2020-03-06 20:04:09 · 217 阅读 · 0 评论 -
面试题 04.10. 检查子树
ProblemT1 and T2 are two very large binary trees, with T1 much bigger than T2. Create an algorithm to determine if T2 is a subtree of T1.A tree T2 is a subtree of T1 if there exists a node n in T1 s...原创 2020-03-06 19:29:57 · 320 阅读 · 0 评论 -
面试题 04.03. List of Depth LCCI
ProblemGiven a binary tree, design an algorithm which creates a linked list of all the nodes at each depth (e.g., if you have a tree with depth D, you’ll have D linked lists). Return a array containi...原创 2020-03-06 20:19:08 · 211 阅读 · 0 评论 -
897. Increasing Order Search Tree && 面试题 17.12. BiNode LCCI
ProblemThe data structure TreeNode is used for binary tree, but it can also used to represent a single linked list (where left is null, and right is the next node in the list). Implement a method to ...原创 2020-02-27 22:42:11 · 553 阅读 · 0 评论 -
110. Balanced Binary Tree && 面试题 04.04. Check Balance LCCI && 面试题55 - II. 平衡二叉树
ProblemImplement a function to check if a binary tree is balanced. For the purposes of this question, a balanced tree is defined to be a tree such that the heights of the two subtrees of any node nev...原创 2020-02-25 23:23:14 · 245 阅读 · 0 评论 -
面试题 04.02. Minimum Height Tree LCCI
ProblemGiven a sorted (increasing order) array with unique integer elements, write an algorithm to create a binary search tree with minimal height.Example1Solution/** * Definition for a binary ...原创 2020-02-25 23:05:31 · 209 阅读 · 0 评论 -
8.5Recursive Multiply
ProblemWrite a recursive function to multiply two positive integers without using the * operator (or / operator). You can use addition, subtraction, and bit shifting, but you should minimize the numbe翻译 2016-08-26 19:15:49 · 521 阅读 · 0 评论 -
62. Unique Paths&机器人走方格I
A robot is located at the top-left corner of a m x n grid (marked 'Start' in the diagram below).The robot can only move either down or right at any point in time. The robot is trying to reach the原创 2015-06-26 09:17:51 · 681 阅读 · 0 评论 -
8.6汉诺塔
ProblemIn the classic problem of the Towers of Hanoi, you have 3 towers and N disks of different sizes which can slide onto any tower. The puzzle starts with disks sorted inascendingorder of size from原创 2016-08-26 21:19:43 · 468 阅读 · 0 评论 -
74.Search a 2D Matrix&240. Search a 2D Matrix II
Write an efficient algorithm that searches for a value in an m x n matrix. This matrix has the following properties:Integers in each row are sorted from left to right.The first integer of each原创 2015-06-27 13:58:20 · 557 阅读 · 0 评论 -
78. Subsets&集合的子集&Power Set
Given a set of distinct integers, S, return all possible subsets.Note:Elements in a subset must be in non-descending order.The solution set must not contain duplicate subsets.For example,原创 2014-03-05 11:49:29 · 949 阅读 · 0 评论 -
魔术索引2
题目描述在数组A[0..n-1]中,有所谓的魔术索引,满足条件A[i]=i。给定一个不下降序列,元素值可能相同,编写一个方法,判断在数组A中是否存在魔术索引。请思考一种复杂度优于o(n)的方法。 给定一个int数组A和int n代表数组大小,请返回一个bool,代表是否存在魔术索引。 测试样例: [1,1,3,4,5] 返回:true解答 如果数组的元素有重复,魔术索引1中的方法就会失效。原创 2016-03-07 22:48:05 · 625 阅读 · 0 评论 -
295. Find Median from Data Stream&数据流中的中位数
题目描述如何得到一个数据流中的中位数?如果从数据流中读出奇数个数值,那么中位数就是所有数值排序之后位于中间的数值。如果从数据流中读出偶数个数值,那么中位数就是所有数值排序之后中间两个数的平均值。解答 如上图所示,如果数据在容器中已经排序,那么中位数可以由和指向的数得到。如果容器中数据的个数是奇数,那么和 指向同一个数据。 注意到,整个容器被分隔成了两部分。位于容器左边部分的数据比右边的数原创 2016-03-14 09:25:14 · 2105 阅读 · 0 评论 -
51.N-Queens&n皇后问题
The n-queens puzzle is the problem of placing n queens on an n×n chessboard such that no two queens attack each other.Given an integer n, return all distinct solutions to the n-queens puzzle.Eac原创 2015-06-24 16:59:45 · 487 阅读 · 0 评论