摘要: Description A valid parentheses string is either empty , , or , where and are valid parentheses strings, and represents string concatenation. For exam阅读全文
posted @ 2019-04-19 20:27 arcsinW 阅读(22) 评论(0) 编辑
摘要: clipboard.js是一个用来设置剪切板的库,小巧无依赖,但用法有点诡异,必须依赖一个DOM元素 据作者说,由于浏览器相关安全策略的缘故,无法使用下面这种方式来设置剪切板 必须要与一个DOM元素相关联,并且需要用户的点击操作才能实现功能(这样看来,浏览器还是挺安全的) 普通使用推荐下面这种用法,阅读全文
posted @ 2019-04-11 18:43 arcsinW 阅读(15) 评论(0) 编辑
摘要: Description Given an array with integers, your task is to check if it could become non decreasing by modifying at most element. We define an array is 阅读全文
posted @ 2019-04-06 15:48 arcsinW 阅读(14) 评论(0) 编辑
摘要: Description Given a tree, rearrange the tree in in order so that the leftmost node in the tree is now the root of the tree, and every node has no left阅读全文
posted @ 2019-02-20 21:28 arcsinW 阅读(35) 评论(0) 编辑
摘要: Description Given a array of integers, every element appears twice except for one. Find that single one. Note: Your algorithm should have a linear run阅读全文
posted @ 2019-02-19 21:56 arcsinW 阅读(15) 评论(0) 编辑
摘要: Description On a table are cards, with a positive integer printed on the front and back of each card (possibly different). We flip any number of cards阅读全文
posted @ 2019-01-24 22:11 arcsinW 阅读(49) 评论(0) 编辑
摘要: Description Given an array of non negative integers, half of the integers in A are odd, and half of the integers are even. Sort the array so that when阅读全文
posted @ 2019-01-23 22:30 arcsinW 阅读(23) 评论(0) 编辑
摘要: Description 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阅读全文
posted @ 2019-01-22 21:39 arcsinW 阅读(24) 评论(0) 编辑
摘要: Description In a array of size , there are unique elements, and exactly one of these elements is repeated N times. Return the element repeated times. 阅读全文
posted @ 2019-01-21 16:17 arcsinW 阅读(23) 评论(0) 编辑
摘要: Description Given an array of integers sorted in non decreasing order, return an array of the squares of each number, also in sorted non decreasing or阅读全文
posted @ 2019-01-21 16:15 arcsinW 阅读(197) 评论(0) 编辑
摘要: Description 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 m阅读全文
posted @ 2019-01-21 16:13 arcsinW 阅读(16) 评论(0) 编辑
摘要: Description Given the root node of a binary search tree (BST) and a value to be inserted into the tree, insert the value into the BST. Return the root阅读全文
posted @ 2019-01-18 19:43 arcsinW 阅读(22) 评论(0) 编辑
摘要: Description The Fibonacci numbers , commonly denoted form a sequence, called the Fibonacci sequence , such that each number is the sum of the two prec阅读全文
posted @ 2019-01-17 20:15 arcsinW 阅读(60) 评论(0) 编辑
摘要: Description Given the node of a binary search tree, return the sum of values of all nodes with value between and (inclusive). The binary search tree i阅读全文
posted @ 2019-01-16 21:54 arcsinW 阅读(33) 评论(0) 编辑
摘要: Description 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 na阅读全文
posted @ 2018-12-18 17:17 arcsinW 阅读(42) 评论(0) 编辑