## 题目描述：

LeetCode 336. Palindrome Pairs

Given a list of unique words. Find all pairs of indices `(i, j)` in the given list, so that the concatenation of the two words, i.e. `words[i] + words[j]` is a palindrome.

Example ...

## 一道关于Java变量初始化的面试题 作者是 在线疯狂 发布于 2016年2月28日 在 Java.

``````class Singleton {
private static Singleton singleton = new Singleton();
public static int counter1;
public static int counter2 = 0;

private Singleton() {
counter1++;
counter2++;
}

public static Singleton getInstance() {
return singleton;
}
}

public class TestSingleton {
public static void main(String[] args) {
Singleton s ...``````

## 题目描述：

LeetCode 335. Self Crossing

You are given an array x of `n` positive numbers. You start at point `(0,0)` and moves `x[0]` metres to the north, then `x[1]` metres to the west, `x[2]` metres to ...

## 题目描述：

LeetCode 334. Increasing Triplet Subsequence

Given an unsorted array return whether an increasing subsequence of length 3 exists or not in the array.

Formally the function should:

Return true if there exists i, j, k
such that arr[i ...

## 题目描述：

LeetCode 332. Reconstruct Itinerary

Given a list of airline tickets represented by pairs of departure and arrival airports `[from, to]`, reconstruct the itinerary in order. All of the tickets belong to a man who departs from `JFK`. Thus, the ...