- 博客(24)
- 收藏
- 关注
RSS订阅原创 Sandboxie源码分析【hook源头分析】
研究Sandboxie知道，在Sandboxie一开始加载子进程时，就已经开始了hook工作。那Sandboxie究竟是在哪一节点开始介入的呢？本篇进行追根溯源。
2023-07-12 19:50:12
473
原创 【算法】【LRU】146. LRU缓存机制
Description设计和实现一个LRU（最近最少使用）缓存数据结构，使它应该支持以下操作： get 和 put 。get(key) - 如果密钥存在于缓存中，则获取密钥的值（值总是正数），否则返回 -1。 put(key, value) - 如果密钥不存在，请设置或插入值。当缓存达到其容量时，它应该在插入新项目之前使最近最少使用的项目作废。后续: 你是否可以在 O(1) 时间复...
2018-04-17 20:35:50
3506
2
原创 数据库 C C++ 操作系统 计算机网络 笔记
数据库参考MySQL索引背后的数据结构及算法原理B-TREE 和 B+-TREE 区别B-TREE：所有节点都存储数据，即所有节点的数据结构相同。B+-TREE：只有叶节点存储数据，其他节点存储键值。InnoDB MyISAM 区别用MyISAM建表时可以不设主键。 InnoDB建索引树时必须按主键排序，故必须有主键。建表时若不指定主键，InnoDB选择可作唯...
2018-04-04 00:20:03
285
原创 Golang HTTP源码 笔记
Go HTTP源码的学习笔记（参考自build-web-application-with-golang）假设有如下代码：package mainimport ( "fmt" "net/http" "strings" "log")func sayhelloName(w http.ResponseWriter, r *http.Request)...
2018-03-19 18:25:07
595
原创 【算法】【Greedy】Jump Game II
Given an array of non-negative integers, you are initially positioned at the first index of the array. Each element in the array represents your maximum jump length at that position.
2017-12-28 12:31:32
260
原创 【算法】【Greedy】Jump Game
Given an array of non-negative integers, you are initially positioned at the first index of the array. Each element in the array represents your maximum jump length at that position.
2017-12-27 18:59:21
217
原创 【算法】【Dynamic Programming】Wildcard Matching
Implement wildcard pattern matching with support for '?' and '*'. ‘?’ Matches any single character. ‘*’ Matches any sequence of characters (including the empty sequence).
2017-12-21 14:37:54
230
原创 【算法】【Dynamic Programming】Wiggle Subsequence
A sequence of numbers is called a wiggle sequence if the differences between successive numbers strictly alternate between positive and negative. The first difference (if one exists) may be either positive or
2017-12-08 15:40:15
151
原创 【算法】【Dynamic Programming】Longest Valid Parentheses
Given a string containing just the characters ‘(’ and ‘)’, find the length of the longest valid (well-formed) parentheses substring.
2017-12-03 21:56:44
173
原创 【算法】【Dynamic Programming】Unique Paths II
Follow up for “Unique Paths”:Now consider if some obstacles are added to the grids. How many unique paths would there be?An obstacle and empty space is marked as 1 and 0 respectively in the grid.
2017-11-26 13:22:41
186
原创 Negroni和Gorilla/mux 解析 Golang
如有错误欢迎纠正, 有缺漏欢迎补充参考资料: https://github.com/urfave/negroni/blob/master/translations/README_zh_CN.md https://github.com/gorilla/mux https://github.com/unrolled/render https://github.com/pmlpml/gola...
2017-11-14 22:31:13
1772
原创 【算法】【Dynamic Programming】Unique Paths
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.
2017-10-29 13:11:13
290
原创 【算法】【Greedy】Queue Reconstruction by Height
Suppose you have a random list of people standing in a queue. Each person is described by a pair of integers (h, k), where h is the height of the person and k is the number of people in front of this person.
2017-10-21 20:55:58
210
原创 【算法】【Graph】Course Schedule
There are a total of n courses you have to take, labeled from 0 to n - 1. Some courses may have prerequisites, for example, to take course 0 you have to first take course 1, which is expressed as a pair: [0,1].
2017-10-14 10:51:34
189
原创 【算法】【Graph】Reconstruct Itinerary
Given a list of airline tickets represented by pairs of departure and arrival airports [from, to], reconstruct the itinerary in order. All of the tickets belong to a man who departs from JFK.
2017-10-07 11:40:56
245
原创 【算法】【Greedy】Patching Array
Given a sorted positive integer array nums and an integer n, add/patch elements to the array such that any number in range [1, n] inclusive can be formed by the sum of some elements in the array.
2017-10-06 16:43:50
187
原创 【算法】【Graph】Evaluate Division
Equations are given in the format A / B = k, where A and B are variables represented as strings, and k is a real number (floating point number). Given some queries, return the answers.
2017-10-05 20:50:27
237
原创 【算法】The Skyline Problem
A city’s skyline is the outer contour of the silhouette formed by all the buildings in that city when viewed from a distance. Now suppose you are given the locations and height
2017-09-24 22:05:14
933
原创 【算法】【Divide and conquer】Kth Largest Element in an Array
Find the kth largest element in an unsorted array. Note that it is the kth largest element in the sorted order, not the kth distinct element.
2017-09-19 21:05:45
372
原创 【算法】【Divide and conquer】Median of Two Sorted Arrays
Difficulty:HardDescriptionThere 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 (m+
2017-09-17 18:14:45
461
原创 【算法】【Divide and conquer】Different Ways to Add Parentheses
Difficulty:MediumDescriptionGiven a string of numbers and operators, return all possible results from computing all the different possible ways to group numbers and operators. The valid operator
2017-09-10 11:17:35
211
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人