09 2019 档案

[LeetCode] 559. Maximum Depth of N-ary Tree
摘要：Easy Given a n-ary tree, find its maximum depth. The maximum depth is the number of nodes along the longest path from the root node down to the farthe 阅读全文
posted @ 2019-09-26 13:47 程嘿嘿 阅读(204) 评论(0) 推荐(0)
[LeetCode] 1122. Relative Sort Array
摘要：Easy Given two arrays arr1 and arr2, the elements of arr2 are distinct, and all elements in arr2 are also in arr1. Sort the elements of arr1 such that 阅读全文
posted @ 2019-09-26 10:18 程嘿嘿 阅读(212) 评论(0) 推荐(0)
[LeetCode] 965. Univalued Binary Tree
摘要：Easy A binary tree is univalued if every node in the tree has the same value. Return true if and only if the given tree is univalued. Example 1: Examp 阅读全文
posted @ 2019-09-24 16:42 程嘿嘿 阅读(197) 评论(0) 推荐(0)
[LeetCode] 811. Subdomain Visit Count
摘要：Easy A website domain like "discuss.leetcode.com" consists of various subdomains. At the top level, we have "com", at the next level, we have "leetcod 阅读全文
posted @ 2019-09-24 16:17 程嘿嘿 阅读(273) 评论(0) 推荐(0)
[LeetCode] 509. Fibonacci Number
摘要：Easy The Fibonacci numbers, commonly denoted F(n) form a sequence, called the Fibonacci sequence, such that each number is the sum of the two precedin 阅读全文
posted @ 2019-09-24 11:22 程嘿嘿 阅读(198) 评论(0) 推荐(0)
[LeetCode] 1200. Minimum Absolute Difference
摘要：Easy Given an array of distinct integers arr, find all pairs of elements with the minimum absolute difference of any two elements. Return a list of pa 阅读全文
posted @ 2019-09-24 10:41 程嘿嘿 阅读(407) 评论(0) 推荐(0)
[LeetCode] 590. N-ary Tree Postorder Traversal
摘要：Easy Given an n-ary tree, return the postorder traversal of its nodes' values. For example, given a 3-ary tree: Return its postorder traversal as: [5, 阅读全文
posted @ 2019-09-19 13:52 程嘿嘿 阅读(253) 评论(0) 推荐(0)
input单选框美化——自定义样式
摘要：方法一： 给input添加 -webkit-appearance: none; 隐藏默认样式。然后添加自己的样式就好了。 例如： .radioBox input{ -webkit-appearance: none; width: 20px; height: 20px; padding: 0; bac 阅读全文
posted @ 2019-09-17 17:16 程嘿嘿 阅读(9674) 评论(0) 推荐(1)
input单选框——获取选中值和设置选中值
摘要：javascript： input单选框CheckBox对象参考：https://www.w3school.com.cn/jsref/dom_obj_checkbox.asp 获取选中值： 判断各选项是否选中： 设置选中值： 设置不选中： jquery： 获取选中值： 方括号里也可以换成单选框的na 阅读全文
posted @ 2019-09-16 15:27 程嘿嘿 阅读(9662) 评论(0) 推荐(0)
[LeetCode] 933. Number of Recent Calls
摘要：Easy Write a class RecentCounter to count recent requests. It has only one method: ping(int t), where t represents some time in milliseconds. Return t 阅读全文
posted @ 2019-09-11 13:59 程嘿嘿 阅读(165) 评论(0) 推荐(0)
[LeetCode] 1051. Height Checker
摘要：Easy Students are asked to stand in non-decreasing order of heights for an annual photo. Return the minimum number of students not standing in the rig 阅读全文
posted @ 2019-09-09 14:03 程嘿嘿 阅读(250) 评论(0) 推荐(0)
[LeetCode] 589. N-ary Tree Preorder Traversal
摘要：Easy Given an n-ary tree, return the preorder traversal of its nodes' values. For example, given a 3-ary tree: Return its preorder traversal as: [1,3, 阅读全文
posted @ 2019-09-06 17:25 程嘿嘿 阅读(155) 评论(0) 推荐(0)
jquery—鼠标移入移出动作与元素的显示和隐藏
摘要：jquery中的鼠标移入和移除动作控制元素的显示或隐藏。 效果： 方法： 使用jquery中的鼠标移入和移除动作： 移入：onmouseover 移出：onmouseout html js css 阅读全文
posted @ 2019-09-05 16:53 程嘿嘿 阅读(6513) 评论(0) 推荐(0)
[LeetCode] 929. Unique Email Addresses
摘要：Easy Every email consists of a local name and a domain name, separated by the @ sign. For example, in alice@leetcode.com, alice is the local name, and 阅读全文
posted @ 2019-09-04 17:21 程嘿嘿 阅读(212) 评论(0) 推荐(0)
[LeetCode] 1160. Find Words That Can Be Formed by Characters
摘要：Easy You are given an array of strings words and a string chars. A string is good if it can be formed by characters from chars (each character can onl 阅读全文
posted @ 2019-09-03 18:03 程嘿嘿 阅读(489) 评论(0) 推荐(0)
[LeetCode] 561. Array Partition I
摘要：Easy Given an array of 2n integers, your task is to group these integers into n pairs of integer, say (a1, b1), (a2, b2), ..., (an, bn) which makes su 阅读全文
posted @ 2019-09-02 15:15 程嘿嘿 阅读(196) 评论(0) 推荐(0)
[LeetCode] 942. DI String Match
摘要：Easy Given a string S that only contains "I" (increase) or "D" (decrease), let N = S.length. Return any permutation A of [0, 1, ..., N] such that for 阅读全文
posted @ 2019-09-02 14:40 程嘿嘿 阅读(146) 评论(0) 推荐(0)
[LeetCode] 852. Peak Index in a Mountain Array
摘要：Easy Let's call an array A a mountain if the following properties hold: A.length >= 3 There exists some 0 < i < A.length - 1 such that A[0] < A[1] < . 阅读全文
posted @ 2019-09-02 13:48 程嘿嘿 阅读(141) 评论(0) 推荐(0)