-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathindex.html
More file actions
17 lines (11 loc) · 5.68 KB
/
index.html
File metadata and controls
17 lines (11 loc) · 5.68 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
<!DOCTYPE html><html lang="zh-CN"><head><meta charset="utf-8"><meta name="X-UA-Compatible" content="IE=edge"><meta name="author"><title>Hexo</title><meta name="description" content="A Blog Powered By Hexo"><meta name="keywords" content=""><meta content="width=device-width, initial-scale=1.0, maximum-scale=1.0, user-scalable=0" name="viewport"><meta content="yes" name="apple-mobile-web-app-capable"><meta content="black" name="apple-mobile-web-app-status-bar-style"><meta content="telephone=no" name="format-detection"><meta name="renderer" content="webkit"><link rel="short icon" href="/images/favicon.png" type="image/x-icon"><link rel="stylesheet" href="/css/bootstrap.min.css"><link rel="stylesheet" href="/css/font-awesome.min.css"><link rel="stylesheet" href="/css/style.css"><link rel="alternate" type="application/atom+xml" title="ATOM 1.0" href="/atom.xml"><meta name="generator" content="Hexo 5.3.0"></head><body><div id="stage" class="container"><div class="row"><div id="side-bar" class="col-sm-3 col-xs-12 side-container invisible"><div class="vertical-text site-title"><h3 tabindex="-1" class="site-title-small"><a href="/" class="a-title">Trizzy33</a></h3><h1 tabindex="-1" class="site-title-large"><a href="/" class="a-title">林深见鹿</a></h1><!--h6(onclick="triggerSiteNav()") Trigger--></div><br class="visible-lg visible-md visible-sm"><div id="site-nav" class="site-title-links"><ul><li><a href="/" class="current">Home</a></li><li><a href="/archives">Archive</a></li><li><a href="/tags">Tags</a></li><li class="soc"><a href="https://github.com//Trizzy33" target="_blank" rel="noopener noreferrer"><i class="fa fa-github"> </i></a><a href="http://weibo.com/u/https://weibo.com/1742432797" target="_blank" rel="noopener noreferrer"><i class="fa fa-weibo"> </i></a></li></ul><div class="visible-lg visible-md visible-sm site-nav-footer"><br class="site-nav-footer-br"><footer><p>© 2021 <a target="_blank" href="https://trizzy33.github.io" rel="noopener noreferrer">trizzy33</a></p><p>Theme <a target="_blank" href="https://github.com/SumiMakito/hexo-theme-typography" rel="noopener noreferrer">Typography</a> by <a target="_blank" href="https://www.keep.moe" rel="noopener noreferrer">Makito</a></p><p>Proudly published with <a target="_blank" href="https://hexo.io" rel="noopener noreferrer">Hexo</a></p></footer></div></div></div><div id="main-container" class="col-sm-9 col-xs-12 main-container invisible"><div class="autopagerize_page_element"><div class="content"><div class="post-container"><p class="post-title"><a href="/2021/02/21/post-1/">数组</a></p><p class="post-meta"><span class="date meta-item">Posted at 2021-02-21</span><span class="meta-item"><i class="fa fa-tag"></i><span> </span><a href="/tags/leetcode/" title="leetcode" class="a-tag">leetcode</a><span> </span></span></p><p class="post-abstract">35. 搜索插入位置https://leetcode-cn.com/problems/search-insert-position/
BF时间：O(n)空间：O(1)
brute force初始版本，写完发现这几个条件其实是重合的，插入到最前面，找到相同的元素，在中间插入，返回的都是当前遍历的i。只要找到了就是当...</p></div><div class="post-container"><p class="post-title"><a href="/2021/01/14/tree/">101.symmetric binary tree</a></p><p class="post-meta"><span class="date meta-item">Posted at 2021-01-14</span><span class="meta-item"><i class="fa fa-tag"></i><span> </span><a href="/tags/leetcode/" title="leetcode" class="a-tag">leetcode</a><span> </span></span></p><p class="post-abstract">Recursive Method一开始想比较每个节点的左子树和右子树，然后发现这样比较并不对，仍然返回对称的结果。看了一下解析，是要比较root的两个子树，里外是不是对称的，里面比较left->right, right->left, 相对的外边就是right->right, left->l...</p></div><div class="post-container"><p class="post-title"><a href="/2021/01/07/note/">笔记</a></p><p class="post-meta"><span class="date meta-item">Posted at 2021-01-07</span><span class="meta-item"><i class="fa fa-tag"></i><span> </span><a href="/tags/数据结构/" title="数据结构" class="a-tag">数据结构</a><span> </span></span></p><p class="post-abstract">数组
连续，fix sized
存储的都是相同type的数据内存部分是连续的，lowest address是第一个数据，highest address则是最后一个数据.每次在插入和删除的时候都需要整段整段的改变。
Complexity
Access
Search
Insertion
Deletion
...</p></div><div class="pagination no-margin-bottom"><p class="clearfix"><p> Page 1 / 1 </p><p><span class="pre pagbuttons"><i class="fa fa-angle-double-left"></i> <a role="navigation" href="/">Previous</a></span><span> </span><span class="next pagbuttons"><a role="navigation" href="/">Next</a> <i class="fa fa-angle-double-right"></i></span></p></p></div></div></div><div class="visible-xs site-bottom-footer"><footer><p>© 2021 <a target="_blank" href="https://trizzy33.github.io" rel="noopener noreferrer">trizzy33</a></p><p>Theme <a target="_blank" href="https://github.com/SumiMakito/hexo-theme-typography" rel="noopener noreferrer">Typography</a> by <a target="_blank" href="https://www.keep.moe" rel="noopener noreferrer">Makito</a></p><p>Proudly published with <a target="_blank" href="https://hexo.io" rel="noopener noreferrer">Hexo</a></p></footer></div></div></div></div><script src="/js/jquery-3.1.0.min.js"></script><script src="/js/bootstrap.min.js"></script><script src="/js/jquery-migrate-1.2.1.min.js"></script><script src="/js/jquery.appear.js"></script><script src="/js/google-analytics.js"></script><script src="/js/typography.js"></script></body></html>