摘要：
很久没有写了。。最近看书的笔记都记在有道云上面。。框架的使用觉得还是有必要写一下 1、下载 官网：https://www.apache.org/dyn/closer.cgi 清华镜像：https://mirrors.tuna.tsinghua.edu.cn/apache/zookeeper/ 在官网 阅读全文
摘要：
select2的组件bug 解决方案： 在bootstrap.js中修改： Modal.prototype.enforceFocus = function () { $(document) .off('focusin.bs.modal') // guard against infinite focu 阅读全文
摘要：
原题 Given a string, determine if a permutation of the string could form a palindrome. For example, "code" False, "aab" True, "carerac" True. 解析 判断是否可以组 阅读全文
摘要：
原题 Given a binary tree, find the leftmost value in the last row of the tree. Example 1: Input: 2 / \ 1 3 Output: 1 Example 2: Input: 1 / \ 2 3 / / \ 4 阅读全文
摘要：
原题 Given an unsorted array nums, reorder it in place such that nums[0] = nums[2] nums[i 1]))) { int temp = nums[i]; nums[i] = nums[i 1]; nums[i 1] = t 阅读全文
摘要：
原题 Given a binary tree, collect a tree's nodes as if you were doing this: Collect and remove all leaves, repeat until the tree is empty. Example: Give 阅读全文
摘要：
原题 Given a non negative integer number num. For every numbers i in the range 0 ≤ i ≤ num calculate the number of 1's in their binary representation an 阅读全文
摘要：
原题 Given an 2D board, count how many battleships are in it. The battleships are represented with 'X's, empty slots are represented with '.'s. You may 阅读全文
摘要：
原题 During the NBA playoffs, we always arrange the rather strong team to play with the rather weak team, like make the rank 1 team play with the rank n 阅读全文
摘要：
原题 You are given two arrays (without duplicates) nums1 and nums2 where nums1’s elements are subset of nums2. Find all the next greater numbers for num 阅读全文