- 博客(7)
- 资源 (2)
- 收藏
- 关注
RSS订阅原创 561. Array Partition I
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 sum of min(ai, bi) for all i from 1 to n as large as poss...
2018-03-11 10:59:26
193
原创 728. Self Dividing Numbers
728. Self Dividing NumbersDescriptionHintsSubmissionsDiscussSolutionPick OneA self-dividing number is a number that is divisible by every digit it contains.For example, 128 is a self-dividing number b...
2018-03-11 10:17:00
165
原创 617. Merge Two Binary Trees python leetcode
617. Merge Two Binary TreesDescriptionHintsSubmissionsDiscussSolutionPick OneGiven two binary trees and imagine that when you put one of them to cover the other, some nodes of the two trees are overla...
2018-03-10 17:47:12
526
原创 657. Judge Route Circle python
657. Judge Route CircleDescriptionHintsSubmissionsDiscussSolutionPick OneInitially, there is a Robot at position (0, 0). Given a sequence of its moves, judge if this robot makes a circle, which means ...
2018-03-10 17:39:49
192
原创 461. Hamming Distance
461. Hamming DistanceDescriptionHintsSubmissionsDiscussSolutionPick OneThe Hamming distance between two integers is the number of positions at which the corresponding bits are different.Given two inte...
2018-03-10 17:24:41
139
原创 771. Jewels and Stones leetcode python
开启python刷题模式，用不惯leetcode。771. Jewels and StonesDescriptionHintsSubmissionsDiscussSolutionPick OneYou're given strings J representing the types of stones that are jewels, and S representing the stones ...
2018-03-10 17:12:36
405
转载 什么是 AES-GCM加密算法
AES是一种对称加密算法，它的相关概念在此不赘述。GCM ( Galois/Counter Mode) 指的是该对称加密采用Counter模式，并带有GMAC消息认证码。在详细介绍AES-GCM之前，我们先了解一些相关概念。下文中出现的符号:Ek使用秘钥k对输入做对称加密运算XOR异或运算Mh将输入与秘钥h在有限域GF(2^128)上做乘法ECB（ Electronic Mode 电子密码本模式）...
2018-03-01 14:55:31
4575
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人