Java DesignPatterns

设计原则

灵活变通，过犹不及。

Java JVM

介绍关于Java JVM的相关概念和内容。

Java进阶概念

介绍Java的一些进阶概念和内容。

leetcode#15 3Sum

Given an array S of n integers, are there elements a, b, c in S such that a + b + c = 0? Find all unique triplets in the array which gives the sum of zero.

leetcode#16 3Sum Closest

Given an array S of n integers, find three integers in S such that the sum is closest to a given number, target. Return the sum of the three integers. You may assume that each input would have exactly one solution.

leetcode#611 Valid Triangle Number

Given an array consists of non-negative integers, your task is to count the number of triplets chosen from the array that can make triangles if we take them as side lengths of a triangle.

leetcode#56 Merge Intervals

Given a collection of intervals, merge all overlapping intervals.

leetcode#495 Teemo Attacking

In LOL world, there is a hero called Teemo and his attacking can make his enemy Ashe be in poisoned condition. Now, given the Teemo’s attacking ascending time series towards Ashe and the poisoning time duration per Teemo’s attacking, you need to output the total time that Ashe is in poisoned condition.

leetcode#57 Insert Interval

Given a set of non-overlapping intervals, insert a new interval into the intervals (merge if necessary).

leetcode#152 Maximum Product Subarray

Find the contiguous subarray within an array (containing at least one number) which has the largest product.