摘要:
/** * 时间复杂度:O(n*n) * 简单选择排序法:每次从剩余元素中选择一个最小值,交换最小值与数组中相应位置上的数值 * n趟 * @param nums */ public static void simpleSelectSort(int[] nums){ for(int i = 0;i 阅读全文
posted @ 2015-12-18 16:39
江湖凶险
阅读(164)
评论(0)
推荐(0)
摘要:
问题描述: Given a binary tree, check whether it is a mirror of itself (ie, symmetric around its center). For example, this binary tree is symmetric: But t 阅读全文
posted @ 2015-12-18 09:59
江湖凶险
阅读(164)
评论(0)
推荐(0)

浙公网安备 33010602011771号