原创 如何簡單地完成超強炫酷的vim配置?

如何簡單地完成超強炫酷的vim配置?vim配置1. vim配置—The Ultimate vimrc:2. vim配置—超強vim配置文件: vim配置 很多小夥伴都遵循大佬路線決定“罷黜ide,獨尊vim”,不過原生態的vim實

原创 LeetCode 64. Minimum Path Sum(最小路徑和)

題目描述:    Given a m x n grid filled with non-negative numbers, find a path from top left to bottom right which minimizes

原创 LeetCode 66. Plus One(加一)

題目描述:    Given a non-negative integer represented as a non-empty array of digits, plus one to the integer.    You may a

原创 LeetCode 65. Valid Number(合法數字→最差的題!)

題目描述:    Validate if a given string is numeric.例子:"0" => true" 0.1 " => true"abc" => false"1 a" => false"2e10" => true注

原创 LeetCode 68. Text Justification(文本格式調整)

題目描述:    Given an array of words and a length L, format the text such that each line has exactly L characters and is fu

原创 LeetCode 63. Unique Paths II(唯一出路Ⅱ)

題目描述:    Follow up for "Unique Paths":    Now consider if some obstacles are added to the grids. How many unique paths

原创 LeetCode 61. Rotate List(循環右移單鏈表)

題目描述:    Given a list, rotate the list to the right by k places, where k is non-negative.例子:Given 1->2->3->4->5->NULL a

原创 LeetCode 57. Insert Interval(插入區間)

題目描述:    Given a set of non-overlapping intervals, insert a new interval into the intervals (merge if necessary).    Yo

原创 LeetCode 60. Permutation Sequence(N排列,第K序列)

題目描述:    The set [1,2,3,…,n] contains a total of n! unique permutations.    By listing and labeling all of the permutat

原创 LeetCode 59. Spiral Matrix II(螺旋矩陣Ⅱ)

題目描述:    Given an integer n, generate a square matrix filled with elements from 1 to n2 in spiral order.    For example

原创 LeetCode 69. Sqrt(x)(x的算術平方根)

題目描述:    Implement int sqrt(int x).    Compute and return the square root of x.    x is guaranteed to be a non-negative

原创 LeetCode 67. Add Binary(二進制加法)

題目描述:    Given two binary strings, return their sum (also a binary string).    For example, a = "11", b = "1", return "

原创 LeetCode 58. Length of Last Word(最後一個單詞長度)

題目描述:    Given a string s consists of upper/lower-case alphabets and empty space characters ' ', return the length of l

原创 LeetCode 56. Merge Intervals(合併重疊區間)

題目描述:    Given a collection of intervals, merge all overlapping intervals.     For example, given [1,3],[2,6],[8,10],[1

原创 人臉檢測技術——深度學習算法原理

人臉檢測技術——深度學習算法原理人臉檢測技術——深度學習算法原理1. 通用目標檢測網絡1.1 faster-rcnn檢測算法的基本原理1.2 faster-rcnn應用於人臉檢測2. 專門應用於人臉檢測的卷積神經網絡2.1 專門用於人