摘要：
public ArrayList reverse(ArrayList list) { for(int i = 0, j = list.size() - 1; i < j; i++) { list.add(i, list.remove(j)); ... 阅读全文
摘要：
Given a binary tree, return thezigzag level ordertraversal of its nodes' values. (ie, from left to right, then right to left for the next level and al... 阅读全文
摘要：
Implement pow(x,n).public class Solution { public double myPow(double x, int n) { if(n == 0) return 1; if(n<0){ ... 阅读全文