<divclass="popular-posts-title"><ahref="/2020/10/25/Leetcode-104-二叉树的最大深度-Maximum-Depth-of-Binary-Tree-题解分析/"rel="bookmark">Leetcode 104 二叉树的最大深度(Maximum Depth of Binary Tree) 题解分析</a></div>
</li>
<liclass="popular-posts-item">
<divclass="popular-posts-title"><ahref="/2020/10/11/Leetcode-2-Add-Two-Numbers-题解分析/"rel="bookmark">Leetcode 2 Add Two Numbers 题解分析</a></div>
<divclass="popular-posts-title"><ahref="/2020/12/13/Leetcode-105-从前序与中序遍历序列构造二叉树-Construct-Binary-Tree-from-Preorder-and-Inorder-Traversal-题解分析/"rel="bookmark">Leetcode 105 从前序与中序遍历序列构造二叉树(Construct Binary Tree from Preorder and Inorder Traversal) 题解分析</a></div>
</li>
<liclass="popular-posts-item">
<divclass="popular-posts-title"><ahref="/2020/09/20/Leetcode-3-Longest-Substring-Without-Repeating-Characters-题解分析/"rel="bookmark">Leetcode 3 Longest Substring Without Repeating Characters 题解分析</a></div>
<divclass="popular-posts-title"><ahref="/2020/10/11/Leetcode-2-Add-Two-Numbers-题解分析/"rel="bookmark">Leetcode 2 Add Two Numbers 题解分析</a></div>
<divclass="popular-posts-title"><ahref="/2020/12/13/Leetcode-105-从前序与中序遍历序列构造二叉树-Construct-Binary-Tree-from-Preorder-and-Inorder-Traversal-题解分析/"rel="bookmark">Leetcode 105 从前序与中序遍历序列构造二叉树(Construct Binary Tree from Preorder and Inorder Traversal) 题解分析</a></div>
<divclass="popular-posts-title"><ahref="/2020/09/20/Leetcode-3-Longest-Substring-Without-Repeating-Characters-题解分析/"rel="bookmark">Leetcode 3 Longest Substring Without Repeating Characters 题解分析</a></div>
<divclass="popular-posts-title"><ahref="/2020/10/25/Leetcode-104-二叉树的最大深度-Maximum-Depth-of-Binary-Tree-题解分析/"rel="bookmark">Leetcode 104 二叉树的最大深度(Maximum Depth of Binary Tree) 题解分析</a></div>
</li>
<liclass="popular-posts-item">
<divclass="popular-posts-title"><ahref="/2020/10/11/Leetcode-2-Add-Two-Numbers-题解分析/"rel="bookmark">Leetcode 2 Add Two Numbers 题解分析</a></div>
<divclass="popular-posts-title"><ahref="/2020/12/13/Leetcode-105-从前序与中序遍历序列构造二叉树-Construct-Binary-Tree-from-Preorder-and-Inorder-Traversal-题解分析/"rel="bookmark">Leetcode 105 从前序与中序遍历序列构造二叉树(Construct Binary Tree from Preorder and Inorder Traversal) 题解分析</a></div>
<divclass="popular-posts-title"><ahref="/2020/10/11/Leetcode-2-Add-Two-Numbers-题解分析/"rel="bookmark">Leetcode 2 Add Two Numbers 题解分析</a></div>
</li>
<liclass="popular-posts-item">
<divclass="popular-posts-title"><ahref="/2020/12/13/Leetcode-105-从前序与中序遍历序列构造二叉树-Construct-Binary-Tree-from-Preorder-and-Inorder-Traversal-题解分析/"rel="bookmark">Leetcode 105 从前序与中序遍历序列构造二叉树(Construct Binary Tree from Preorder and Inorder Traversal) 题解分析</a></div>
<divclass="popular-posts-title"><ahref="/2020/10/25/Leetcode-104-二叉树的最大深度-Maximum-Depth-of-Binary-Tree-题解分析/"rel="bookmark">Leetcode 104 二叉树的最大深度(Maximum Depth of Binary Tree) 题解分析</a></div>
</li>
<liclass="popular-posts-item">
<divclass="popular-posts-title"><ahref="/2020/09/20/Leetcode-3-Longest-Substring-Without-Repeating-Characters-题解分析/"rel="bookmark">Leetcode 3 Longest Substring Without Repeating Characters 题解分析</a></div>
<divclass="popular-posts-title"><ahref="/2020/12/13/Leetcode-105-从前序与中序遍历序列构造二叉树-Construct-Binary-Tree-from-Preorder-and-Inorder-Traversal-题解分析/"rel="bookmark">Leetcode 105 从前序与中序遍历序列构造二叉树(Construct Binary Tree from Preorder and Inorder Traversal) 题解分析</a></div>
<divclass="popular-posts-title"><ahref="/2020/12/13/Leetcode-105-从前序与中序遍历序列构造二叉树-Construct-Binary-Tree-from-Preorder-and-Inorder-Traversal-题解分析/"rel="bookmark">Leetcode 105 从前序与中序遍历序列构造二叉树(Construct Binary Tree from Preorder and Inorder Traversal) 题解分析</a></div>
<divclass="popular-posts-title"><ahref="/2020/09/20/Leetcode-3-Longest-Substring-Without-Repeating-Characters-题解分析/"rel="bookmark">Leetcode 3 Longest Substring Without Repeating Characters 题解分析</a></div>
<divclass="popular-posts-title"><ahref="/2020/10/25/Leetcode-104-二叉树的最大深度-Maximum-Depth-of-Binary-Tree-题解分析/"rel="bookmark">Leetcode 104 二叉树的最大深度(Maximum Depth of Binary Tree) 题解分析</a></div>
</li>
<liclass="popular-posts-item">
<divclass="popular-posts-title"><ahref="/2020/10/11/Leetcode-2-Add-Two-Numbers-题解分析/"rel="bookmark">Leetcode 2 Add Two Numbers 题解分析</a></div>
<divclass="popular-posts-title"><ahref="/2020/12/13/Leetcode-105-从前序与中序遍历序列构造二叉树-Construct-Binary-Tree-from-Preorder-and-Inorder-Traversal-题解分析/"rel="bookmark">Leetcode 105 从前序与中序遍历序列构造二叉树(Construct Binary Tree from Preorder and Inorder Traversal) 题解分析</a></div>
</li>
<liclass="popular-posts-item">
<divclass="popular-posts-title"><ahref="/2020/09/20/Leetcode-3-Longest-Substring-Without-Repeating-Characters-题解分析/"rel="bookmark">Leetcode 3 Longest Substring Without Repeating Characters 题解分析</a></div>
<divclass="popular-posts-title"><ahref="/2020/10/11/Leetcode-2-Add-Two-Numbers-题解分析/"rel="bookmark">Leetcode 2 Add Two Numbers 题解分析</a></div>
</li>
<liclass="popular-posts-item">
<divclass="popular-posts-title"><ahref="/2020/12/13/Leetcode-105-从前序与中序遍历序列构造二叉树-Construct-Binary-Tree-from-Preorder-and-Inorder-Traversal-题解分析/"rel="bookmark">Leetcode 105 从前序与中序遍历序列构造二叉树(Construct Binary Tree from Preorder and Inorder Traversal) 题解分析</a></div>
<divclass="popular-posts-title"><ahref="/2020/10/25/Leetcode-104-二叉树的最大深度-Maximum-Depth-of-Binary-Tree-题解分析/"rel="bookmark">Leetcode 104 二叉树的最大深度(Maximum Depth of Binary Tree) 题解分析</a></div>
</li>
<liclass="popular-posts-item">
<divclass="popular-posts-title"><ahref="/2020/12/13/Leetcode-105-从前序与中序遍历序列构造二叉树-Construct-Binary-Tree-from-Preorder-and-Inorder-Traversal-题解分析/"rel="bookmark">Leetcode 105 从前序与中序遍历序列构造二叉树(Construct Binary Tree from Preorder and Inorder Traversal) 题解分析</a></div>
</li>
<liclass="popular-posts-item">
<divclass="popular-posts-title"><ahref="/2020/10/11/Leetcode-2-Add-Two-Numbers-题解分析/"rel="bookmark">Leetcode 2 Add Two Numbers 题解分析</a></div>
<divclass="popular-posts-title"><ahref="/2020/12/13/Leetcode-105-从前序与中序遍历序列构造二叉树-Construct-Binary-Tree-from-Preorder-and-Inorder-Traversal-题解分析/"rel="bookmark">Leetcode 105 从前序与中序遍历序列构造二叉树(Construct Binary Tree from Preorder and Inorder Traversal) 题解分析</a></div>
<metaproperty="og:description"content="前几天同事问了我个 mysql 索引的问题,虽然大概知道,但是还是想来实践下,就是 is null,is not null 这类查询是否能用索引,可能之前有些网上的文章说都是不能用索引,但是其实不是,我们来看个小试验 12345678910CREATE TABLE `null_index_t` ( `id` int(10) unsigned NOT NULL AUTO_INCREMENT, `">
<p><imgdata-src="https://gitee.com/nicksxs/images/raw/master/uPic/1HKVQH.png"alt=""><br>是不是不一样了,这里再补充下我试验使用的 mysql 是 5.7 的,不保证在其他版本的一致性,<br>其实可以看出随着数据量的变化,mysql 会不会使用索引是会变化的,不是说 is not null 一定会使用,也不是一定不会使用,而是优化器会根据查询成本做个预判,这个预判尽可能会减小查询成本,主要包括回表啥的,但是也不一定完全准确。</p>
<p><imgdata-src="https://gitee.com/nicksxs/images/raw/master/uPic/1HKVQH.png"alt=""><br>是不是不一样了,这里再补充下我试验使用的 mysql 是 5.7 的,不保证在其他版本的一致性,<br>其实可以看出随着数据量的变化,mysql 会不会使用索引是会变化的,不是说 is not null 一定会使用,也不是一定不会使用,而是优化器会根据查询成本做个预判,这个预判尽可能会减小查询成本,主要包括回表啥的,但是也不一定完全准确。</p>
{"title":"Leetcode 105 从前序与中序遍历序列构造二叉树(Construct Binary Tree from Preorder and Inorder Traversal) 题解分析","url":"/2020/12/13/Leetcode-105-从前序与中序遍历序列构造二叉树-Construct-Binary-Tree-from-Preorder-and-Inorder-Traversal-题解分析/"},