摘要: 题目介绍: Given a string which contains only lowercase letters, remove duplicate letters so that every letter appear once and only once. You must make sur 阅读全文
posted @ 2016-01-17 11:12 江湖凶险 阅读(527) 评论(0) 推荐(0) 编辑
摘要: /** * 时间复杂度:O(n*n) * 简单选择排序法:每次从剩余元素中选择一个最小值,交换最小值与数组中相应位置上的数值 * n趟 * @param nums */ public static void simpleSelectSort(int[] nums){ for(int i = 0;i 阅读全文
posted @ 2015-12-18 16:39 江湖凶险 阅读(157) 评论(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 江湖凶险 阅读(157) 评论(0) 推荐(0) 编辑
摘要: 问题描述: You are a product manager and currently leading a team to develop a new product. Unfortunately, the latest version of your product fails the qua 阅读全文
posted @ 2015-12-16 21:55 江湖凶险 阅读(151) 评论(0) 推荐(0) 编辑
摘要: 问题描述: Given a non-negative number represented as an array of digits, plus one to the number. The digits are stored such that the most significant digi 阅读全文
posted @ 2015-12-16 16:47 江湖凶险 阅读(136) 评论(0) 推荐(0) 编辑
摘要: 问题描述: Reverse digits of an integer. Example1: x = 123, return 321Example2: x = -123, return -321 分析:将一个整数逆序输出,需要判断是否越界。Integer.MAX_VALUE,Integer.MIN_V 阅读全文
posted @ 2015-12-16 16:23 江湖凶险 阅读(212) 评论(0) 推荐(0) 编辑
摘要: 问题描述: Given an integer, write a function to determine if it is a power of two. 问题分析:给定一个数,判断它是不是2的幂。因为2的幂 >= 0 ,所以是针对非负数的。那么这个数 %2为0 代码: 阅读全文
posted @ 2015-12-16 15:28 江湖凶险 阅读(120) 评论(0) 推荐(0) 编辑
摘要: 算法描述: Given a sorted array, remove the duplicates in place such that each element appear only once and return the new length. Do not allocate extra sp 阅读全文
posted @ 2015-12-16 14:40 江湖凶险 阅读(108) 评论(0) 推荐(0) 编辑
摘要: 问题描述: Given an array and a value, remove all instances of that value in place and return the new length. The order of elements can be changed. It does 阅读全文
posted @ 2015-12-14 16:54 江湖凶险 阅读(139) 评论(0) 推荐(0) 编辑
摘要: 问题描述: Write a program to find the n-th ugly number. Ugly numbers are positive numbers whose prime factors only include 2, 3, 5. For example, 1, 2, 3, 阅读全文
posted @ 2015-12-14 15:27 江湖凶险 阅读(161) 评论(0) 推荐(0) 编辑