發(fā)簡信
IP屬地：北京
-
【算法】Longest Substring Without Repeating Characters 最長無重復(fù)字符子串
題目 Given a string, find the length of the longest substring without repeating character...
-
【算法】Nth Magical Number 第N個神奇數(shù)字
題目 A positive integer is magical if it is divisible by either A or B. Return the N-th m...
-
【算法】Self Crossing 自我相交
題目 You are given an array x of n positive numbers. You start at point (0,0) and moves x...
-
【算法】Best Time to Buy and Sell Stock IV 交易股票嘴角時機(jī)4
@toc 題目 Say you have an array for which the i-th element is the price of a given stock ...
-
【算法】Longest Valid Parentheses 最長有效括號
題目 Given a string containing just the characters '(' and ')', find the length of the lo...
-
【算法】Create Maximum Number 創(chuàng)建最大數(shù)
題目 Given two arrays of length m and n with digits 0-9 representing two numbers. Create ...
-
【算法】Regular Expression Matching 正則匹配
題目 Given an input string ( s ) and a pattern ( p ), implement regular expression matchi...
-
【算法】Decode Ways II 解碼方式2
題目 A message containing letters from A-Z is being encoded to numbers using the followin...
-
【算法】Split Array With Same Average 拆分?jǐn)?shù)組為兩個平均值的子數(shù)組
題目 In a given integer array A, we must move every element of A to either list B or list...
-
【算法】Text Justification 文本對齊
題目 Given an array of words and a width maxWidth, format the text such that each line ha...
-
iOS-FFmpeg音視頻開發(fā)荷腊，F(xiàn)Fmpeg解碼，openGL渲染YUV像素格式急凰，H264解碼女仰，播放器搭建（kxmovie，ijkplayer）大部分都是C抡锈，C++疾忍，OC語言.
-
【算法】Substring with Concatenation of All Words 所有單詞鏈接而成的子串
題目 You are given a string, s, and a list of words, words, that are all of the same leng...
-
【算法】Shortest Subarray with Sum at Least K 求數(shù)組中區(qū)間和大于等于 K 的最小子數(shù)組長度
題目 Return the length of the shortest, non-empty, contiguous subarray of A with sum at l...
-
Mac 下安裝配置 iTerm 和 oh-my-zsh
iTerm是什么 簡單來說 Mac 自帶的 terminal 就相當(dāng)于 Windows 中的 IE，而 iTerm 就相當(dāng)于 Chrome床三。如果上面的話不太理解的話一罩，相比其實(shí)...
-
【算法】Reverse Pairs 翻轉(zhuǎn)對，BIT 解法
@[toc] 題目 Given an array nums, we call (i, j) an important reverse pair if i < j and nu...
-
吃透 Binary Indexed Trees （樹狀數(shù)組）
簡介 Binary Indexed Trees（中文名為樹狀數(shù)組撇簿，下文簡稱為BIT）是一種特殊的數(shù)據(jù)結(jié)構(gòu)聂渊，適用于高效計算數(shù)列的前綴和差购， 區(qū)間和。 時間復(fù)雜度： 任意前綴和汉嗽、區(qū)...
