發(fā)簡信
IP屬地：北京
-
Android開發(fā) - 布局優(yōu)化記錄
1、RelativeLayout，ConstrantLayout，LinearLayout的選擇 盡量選用RelativeLayout，Cons...
-
(待完成)LeetCode - 4
Median of Two Sorted Arrays There are two sorted arrays nums1 and nums2 ...
-
LeetCode - 3
Longest Substring Without Repeating Characters Given a string, find the ...
-
LeetCode - 2
Add Two Numbers You are given two non-empty linked lists representing tw...
-
LeetCode - 1
Two Sum Given an array of integers, return indices of the two numbers su...
-
導(dǎo)數(shù)的通俗講法
待完成！
-
算法分享第6題
題目：用兩個(gè)棧實(shí)現(xiàn)一個(gè)隊(duì)列，只要求實(shí)現(xiàn)入隊(duì)，出隊(duì)方法即可. 假設(shè)這兩個(gè)棧分別為s1，s2 分析思路1、棧的特性為：先進(jìn)后出；隊(duì)列的特性為：先進(jìn)先...
-
時(shí)間復(fù)雜度的通俗講法時(shí)間頻度： 一個(gè)算法花費(fèi)的時(shí)間與算法中語句的執(zhí)行次數(shù)成正比，我們將算法中的語句執(zhí)行次數(shù)稱為語句頻度或時(shí)間頻度，記為T(n)，n稱為問題的規(guī)模. ...
-
算法分享第5題題目：Given a string containing just the characters '(',')','{','}','[' and...