### [LeetCode] Intersection of Two Arrays

Given two arrays, write a function to compute their intersection. Example: Given nums1 ...

### [LeetCode] Self Crossing

You are given an array x of n positive numbers. You start at point (0,0) and moves x[0] m...

### [LeetCode] Palindrome Pairs

Given a list of unique words. Find all pairs of distinct indices (i, j) in the given list...

### [LeetCode] Counting Bits

Given a non negative integer number num. For every numbers i in the range 0 ≤ i ≤ num cal...

### [LeetCode] Flatten Nested List Iterator

Given a nested list of integers, implement an iterator to flatten it. Each element is ei...

### [LeetCode] Power of Four

Given an integer (signed 32 bits), write a function to check whether it is a power of 4. ...

### [LeetCode] Integer Break

Given a positive integer n, break it into the sum of at least two positive integers and m...

### [LeetCode] Reverse Vowels of a String

Write a function that takes a string as input and reverse only the vowels of a string. E...

### [LeetCode] Top K Frequent Elements

Given a non-empty array of integers, return the k most frequent elements. For example, ...

### 数据库记录模拟器——DataEmulator

Introduction 该工具可以根据数据库表的描述文件模拟数据库表记录。 Github：https://github.com/chinaeagle001/DataEmul...

### 日志组件slf4j介绍及配置详解

1 基本介绍 每一个Java程序员都知道日志对于任何一个Java应用程序，尤其是服务端程序是至关重要的，而很多程序员也已经熟悉各种不同的日志库如java.util.loggin...

### JMockit学习笔记

1 基本概念 1.1 常用注解 @Mocked：被修饰的对象将会被Mock，对应的类和实例都会受影响（同一个测试用例中） @Injectable：仅Mock被修饰的对象...

3

cici是夏莞
cici是夏莞

1484123956456443
1484123956456443

1179223276962984
1179223276962984

snailclimb
snailclimb

spring-master
spring-master