程嘿嘿

2019年9月2日

摘要： 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 程嘿嘿阅读(145) 评论(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 程嘿嘿阅读(91) 评论(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 程嘿嘿阅读(115) 评论(0) 推荐(0) 编辑

2019年8月29日

[LeetCode] 461. Hamming Distance

摘要： Easy The Hamming distance between two integers is the number of positions at which the corresponding bits are different. Given two integers x and y, c 阅读全文

posted @ 2019-08-29 17:37 程嘿嘿阅读(109) 评论(0) 推荐(0) 编辑

[LeetCode] 617. Merge Two Binary Trees

摘要： Easy Given two binary trees and imagine that when you put one of them to cover the other, some nodes of the two trees are overlapped while the others 阅读全文

posted @ 2019-08-29 17:07 程嘿嘿阅读(113) 评论(0) 推荐(0) 编辑

2019年8月28日

[Leetcode]728. Self Dividing Numbers

摘要： Easy A self-dividing number is a number that is divisible by every digit it contains. For example, 128 is a self-dividing number because 128 % 1 == 0, 阅读全文

posted @ 2019-08-28 17:20 程嘿嘿阅读(256) 评论(0) 推荐(0) 编辑

[Leetcode]977. Squares of a Sorted Array

摘要： Easy Given an array of integers A sorted in non-decreasing order, return an array of the squares of each number, also in sorted non-decreasing order. 阅读全文

posted @ 2019-08-28 16:49 程嘿嘿阅读(512) 评论(0) 推荐(0) 编辑

2019年8月27日

[Leetcode]961. N-Repeated Element in Size 2N Array

摘要： Easy In a array A of size 2N, there are N+1 unique elements, and exactly one of these elements is repeated N times. Return the element repeated N time 阅读全文

posted @ 2019-08-27 22:04 程嘿嘿阅读(100) 评论(0) 推荐(0) 编辑

[Leetcode]657. Robot Return to Origin

摘要： Easy There is a robot starting at position (0, 0), the origin, on a 2D plane. Given a sequence of its moves, judge if this robot ends up at (0, 0) aft 阅读全文

posted @ 2019-08-27 21:43 程嘿嘿阅读(212) 评论(0) 推荐(0) 编辑

win10安装配置face_recognition—Python

摘要：在github上下载了人脸识别算法face_recognition的源码，但在win10上运行有问题，通过查询资料，终于成功了。下面是在win10系统中对face_recognition的下载和配置步骤的总结。参考：https://github.com/ageitgey/face_recognit 阅读全文

posted @ 2019-08-27 16:04 程嘿嘿阅读(1652) 评论(0) 推荐(0) 编辑

公告