2015年12月3日

[lintcode easy]Compare Strings
摘要： Compare StringsCompare two strings A and B, determine whether A contains all of the characters in B.The characters in string A and B are all Upper Cas... 阅读全文
posted @ 2015-12-03 04:28 一心一念 阅读(191) 评论(0) 推荐(0)
[lintcode easy]Insert Node in a Binary Search Tree
摘要： Insert Node in a Binary Search TreeExampleGiven binary search tree as follow, after Insert node 6, the tree should be: 2 2 / \ ... 阅读全文
posted @ 2015-12-03 04:12 一心一念 阅读(135) 评论(0) 推荐(0)
[lintcode easy]Product of Array Exclude Itself
摘要： Product of Array Exclude ItselfGiven an integers array A.Define B[i] = A[0] * ... * A[i-1] * A[i+1] * ... * A[n-1], calculate B WITHOUT divide operati... 阅读全文
posted @ 2015-12-03 04:12 一心一念 阅读(292) 评论(0) 推荐(0)
[lintcode easy]Permutation Index
摘要： Permutation IndexGiven a permutation which contains no repeated number, find its index in all the permutations of these numbers, which are ordered in ... 阅读全文
posted @ 2015-12-03 03:40 一心一念 阅读(690) 评论(0) 推荐(0)
hashmap in java(转)
摘要： 第1部分 HashMap介绍HashMap简介HashMap 是一个散列表，它存储的内容是键值对(key-value)映射。HashMap 继承于AbstractMap，实现了Map、Cloneable、java.io.Serializable接口。HashMap 的实现不是同步的，这意味着它不是线... 阅读全文
posted @ 2015-12-03 02:33 一心一念 阅读(253) 评论(0) 推荐(0)

导航