06 2019 档案

[LeetCode] 121. Best Time to Buy and Sell Stock
摘要：Say you have an array for which the ith element is the price of a given stock on day i. If you were only permitted to complete at most one transaction 阅读全文
posted @ 2019-06-26 11:20 程嘿嘿 阅读(154) 评论(0) 推荐(0)
[LeetCode] 116. Populating Next Right Pointers in Each Node
摘要：You are given a perfect binary tree where all leaves are on the same level, and every parent has two children. The binary tree has the following defin 阅读全文
posted @ 2019-06-12 11:59 程嘿嘿 阅读(150) 评论(0) 推荐(0)
[LeetCode] 113. Path Sum II
摘要：Given a binary tree and a sum, find all root-to-leaf paths where each path's sum equals the given sum. Note: A leaf is a node with no children. Exampl 阅读全文
posted @ 2019-06-07 14:15 程嘿嘿 阅读(169) 评论(0) 推荐(0)
jQuery实现图片添加及预览
摘要：效果如下： 方法： 添加图片使用了<input>标签，将标签的type设置为file就可以点击打开文件夹添加文件了。 当前在页面表现为一个输入栏 如果不想要输入栏可以将其隐藏：将其display设置为none，并使用图片元素代替点击。相当于给点击选择文件换一种展现形式。 添加一个图片表示点击该图片添 阅读全文
posted @ 2019-06-05 20:00 程嘿嘿 阅读(12080) 评论(0) 推荐(1)
H5移动端适配——解决移动端必须手动调整以适配的问题
摘要：问题： H5网页在移动端浏览器上打开时过大，需要双击或者手动调整才能适配屏幕。效果如下： 问题的根本原因是：写网页的时候尺寸设置过大(･ัω･ั) 直接按照UI给的设计图上的尺寸设置后，整个页面变成了它本应该大小的2倍大。原因在于一般UI给的单位是物理像素，而css中的像素是一个抽象值，css中的1 阅读全文
posted @ 2019-06-04 17:25 程嘿嘿 阅读(964) 评论(0) 推荐(0)
[LeetCode] 110. Balanced Binary Tree
摘要：Given a binary tree, determine if it is height-balanced. For this problem, a height-balanced binary tree is defined as: a binary tree in which the dep 阅读全文
posted @ 2019-06-04 16:49 程嘿嘿 阅读(163) 评论(0) 推荐(0)
[LeetCode] 106. Construct Binary Tree from Inorder and Postorder Traversal
摘要：Given inorder and postorder traversal of a tree, construct the binary tree. Note:You may assume that duplicates do not exist in the tree. For example, 阅读全文
posted @ 2019-06-03 18:21 程嘿嘿 阅读(127) 评论(0) 推荐(0)