Ellis_hym的博客

开始看剑指offer，粗略的捋一捋里面的面试题：以下代码大多用python3写的，少部分会用C++ python代码看上去更加简洁明了，里面也穿插和补充了我的部分总结。p38:二维数组中的查找：从右上角或者左下角开始：def searchMatrix( matrix, target): """ :type matrix: List[List[int]] :type targ

利用字典，zip函数，再排序，则这两个题投机取消的很简单。347 Top K Frequent Elementsclass Solution(object): def topKFrequent(self, nums, k): d={} for i in nums: if i in d: d[i]+=1

遍历：前序遍历： 节点-左-右使用一个栈来实现，非递归：class Solution(object): def preorderTraversal(self, root): """ :type root: TreeNode :rtype: List[int] """ if not root:return []

回顾一下，链表： 445. Add Two Numbers II 这个题目，最开始就考虑反转链表，但是题目不允许，我采取了用 栈 把链表里的数取出来的做法。。 后面的做法和 add two numbers 1 差不多了class ListNode(object): def __init__(self, x): self.val = x self.n

Counting Bits看看数 0 0 dp[0]=0 1 1 dp[1]=dp[1-1]+1 2 10 dp[2]=dp[2-2]+14 100 dp[4]=dp[4-4]+18 1000 dp[8]=dp[8-8]+1动态规划：dp[i]=dp[i-offset]+1 代码：class Solution(object): def countBits(self, n

来来，复习基础的数据结构吧~~知乎上有人讲，如果只是应付面试，重要程度： 数据结构：二叉树>散列表>栈>队列>堆>一般树>图>其他 算法：二分法>冒泡>快速排序>加密算法>其他排序算法>随机数的算法>其他下面需要20分钟就能 浏览完，最最基础的：基本排序与二分查找~~排序#插入排序def insertion_sort(nums): for i in range(1,len(nums))

485 Max Consecutive Ones 求连续的1的个数 第一个想到的老办法，用两个指针：start来记录开始与结束class Solution(object): def findMaxConsecutiveOnes(self, nums): """ :type nums: List[int] :rtype: int

leetcode

这个题目就是求子集，如【1，2】的子集就是【1】【2】【1，2】【】，别忘了空集。我想到的最容易的做法就是分治，用递归的方法求，求完之后再加上空集。 比如说：求【1，2】的子集。 1. 先求【1】的子集【1】 2. 再求【2】的子集【2】 3. 把子集”加”起来 [a+b for a in l1 for b in l2]+l1+l2 1. 最后再加上空集整体代码如下：class Solut

Given a string, find the length of the longest substring without repeating characters.Examples:Given "abcabcbb", the answer is "abc", which the length is 3.Given "bbbbb", the answer is "b", with the le

第16题是找一个和target最接近的数，两个指针双层遍历即可：class Solution(object): def threeSumClosest(self, nums, target): result=nums[0]+nums[1]+nums[2] nums.sort() for i in range(len(nums)-2):

The gray code is a binary numeral system where two successive values differ in only one bit.Given a non-negative integer n representing the total number of bits in the code, print the sequence of gray

Given an integer array with all positive numbers and no duplicates, find the number of possible combinations that add up to a positive integer target.Example:_**nums**_ = [1, 2, 3]_**target**_ = 4The

There are n bulbs that are initially off. You first turn on all the bulbs. Then, you turn off every second bulb. On the third round, you toggle every third bulb (turning on if it’s off or turning off i

Find the nth digit of the infinite integer sequence 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, …Note: n is positive and will fit within the range of a 32-bit signed integer (n < 231).Example 1:**Input:**3**O

You are given two linked lists representing two non-negative numbers. The most significant digit comes first and each of their nodes contain a single digit. Add the two numbers and return it as a linke

You are given a map in form of a two-dimensional integer grid where 1 represents land and 0 represents water. Grid cells are connected horizontally/vertically (not diagonally). The grid is completely s

Given a collection of intervals, find the minimum number of intervals you need to remove to make the rest of the intervals non-overlapping.Note:You may assume the interval’s end point is always bigger

Given a linked list and a value x, partition it such that all nodes less than x come before nodes greater than or equal to x.You should preserve the original relative order of the nodes in each of the

Given a non-empty string containing an out-of-order English representation of digits 0-9, output the digits in ascending order.Note:Input contains only lowercase English letters.Input is guaranteed t

这个模块只有几个函数，一旦决定使用二分搜索时，立马要想到使用这个模块.    >>>import bisect     >>>dir(bisect)     [‘builtins‘, ‘cached‘, ‘doc‘, ‘file‘, ‘loader‘, ‘name‘, ‘package‘, ‘spec‘, ‘bisect’, ‘bisect_left’, ‘bisect_right’, ‘ins

Given a string s and a non-empty string p, find all the start indices of p’s anagrams in s.Strings consists of lowercase English letters only and the length of both strings s and p will not be larger t

Given a string, sort it in decreasing order based on the frequency of characters. 就是按频数来排序呗！！ 我的做法是先写成字典，然后用sorted和zip函数一起对字典的value进行排序。class Solution(object):    def frequencySort(self, s):

root = [10,5,-3,3,2,null,11,3,-2,null,1], sum = 8 10 / \ 5 -3 / \ \ 3 2 11 / \ \3 -2 1Return 3\. The paths that sum to 8 are:1\. 5 -> 32\. 5 -> 2 -> 13\. -3 -> 1

代码比较简单，分为奇数偶数讨论。 如果有第19行，运行时间35ms;没有的话 39ms.class Solution(object): def repeatedSubstringPattern(self, str): """ :type str: str :rtype: bool """ n=len(str)

Assume you are an awesome parent and want to give your children some cookies. But, you should give each child at most one cookie. Each child i has a greed factor gi, which is the minimum size of a cook

Suppose a sorted array is rotated at some pivot unknown to you beforehand.(i.e., 0 1 2 4 5 6 7 might become 4 5 6 7 0 1 2).You are given a target value to search. If found in the array return its index

Follow up for “Find Minimum in Rotated Sorted Array”: What if duplicates are allowed? Would this affect the run-time complexity? How and why?Suppose a sorted array is rotated at some pivot unk

原题的输入输出：**Input:**[[0,0],[1,0],[2,0]]**Output:**2**Explanation:**The two boomerangs are **[[1,0],[0,0],[2,0]]** and **[[1,0],[2,0],[0,0]]**直译是找回旋镖的个数。 我将其理解为 ：先确定点 i，找到点k,j使得点i、k距离与点ij的距离相等。class S

原题： 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, 0). Find tw

此问题来自：C和C++程序员面试秘笈 p15 方法：用atexit（）函数来注册 程序正常终止时要被调用的函数用法：用 法: int atexit(void (*func)(void));其参数是一个指针函数，指向一个没有参数也没有返回值的函数例子：#include <stdio.h>#include<stdlib.h> //atexit包含在此void fn1(void);void fn2

216. Combination Sum III大意是说在1-9中选k个不同的数，使他们的和是n，返回是所有的选择。 Example 1: 输入: k = 3, n = 7 输出:[[1,2,4]] Example 2: 输入: k = 3, n = 9 输出:[[1,2,6], [1,3,5], [2,3,4]]思路： 1. 输入的k 肯定在必须在 1-9

Given a non-empty integer array of size n, find the minimum number of moves required to make all array elements equal, where a move is incrementing n - 1 elements by 1.Example:**Input:**[1,2,3]**Outp

输入输出示例 Input:Digit string “23” Output: [“ad”, “ae”, “af”, “bd”, “be”, “bf”, “cd”, “ce”, “cf”].我采用了将输入拆成两部分，然后再把结果加起来的方法。class Solution(object): def letterCombinations(self, digits): "

这个题目简单，求题设条件中没有的数，即集合的差集，题目要求不能有额外的空间，用列表生成式来写。class Solution(object): def findDisappearedNumbers(self, nums): """ :type nums: List[int] :rtype: List[int] """

即找出数组中的重复的数字，题目咋一看比较简单，但是要求不允许使用额外的空间，复杂度为o(n)class Solution(object): def findDuplicates(self, nums): """ :type nums: List[int] :rtype: List[int] """ return

题目很简单，把题目读懂最重要，笔者随手写点。。原题：#include #include using namespace std; class cd_key{ private: string mystring="23456789ABCDEFGHJKLMNPQRSTUVWXYZ"; char mychar='-'; public: stri

之前同学上笔试的时候拍下来的，自己随便写了一点，水平较低，仅供参考。原题：原题只需要解码，我把编码、解码都写了一下：#include#includeusing namespace std;class Youcheng{    public:        //解码        string decode(string & s){