Hashtable
文章平均质量分 64
再见小小ronnie
这个作者很懒,什么都没留下…
展开
-
Leetcode 36. Valid Sudoku
public class Solution { public boolean isValidSudoku(char[][] board) { int row = board.length; int col = board[0].length; HashSet hs = new HashSet(); // check if ro原创 2017-01-09 12:17:17 · 128 阅读 · 0 评论 -
Leetcode 438. Find All Anagrams in a String
O(t.length() * s.length())public class Solution { public List findAnagrams(String s, String p) { List list = new ArrayList<>(); // create an array to save the counts for原创 2017-01-12 13:31:26 · 303 阅读 · 0 评论 -
Leetcode 409. Longest Palindrome
public class Solution { public int longestPalindrome(String s) { int len = 0; // an integer array to save the frequency of the letters in s int[] hash = new int[128];原创 2017-01-13 04:19:21 · 205 阅读 · 0 评论 -
Leetcode 49. Group Anagrams
public class Solution { public List> groupAnagrams(String[] strs) { if(strs==null || strs.length == 0){ return new ArrayList>(); } // create a hashmap that saves letters原创 2017-01-13 05:17:27 · 175 阅读 · 0 评论 -
Leetcode 454. 4Sum II
public class Solution { public int fourSumCount(int[] A, int[] B, int[] C, int[] D) { int count = 0; int length = A.length; // create a hashmap saves the sum and numebr of原创 2017-01-13 05:54:20 · 198 阅读 · 0 评论 -
Sub Array Sum to 0
Using a hashmap to save the sum and index pair, initialize the map to sum the integers in the array, if we meet a sum that exits in the map, means we found a subarray that sums to 0,return the beg原创 2017-03-07 12:44:56 · 280 阅读 · 0 评论 -
Leetcode 128. Longest Consecutive Sequence
A hashset to save all unique numbers in the array.left indicates the number that is 1 less that target, right indicate the number that is 1 greater than target, here, target is nums[i]keep decreas原创 2017-03-08 08:50:09 · 186 阅读 · 0 评论 -
Leetcode 146. LRU Cache
public class LRUCache { // double linked list private class Node { Node prev; Node next; int key; int value; public Node (int key, int value) {原创 2017-03-07 11:22:50 · 188 阅读 · 0 评论 -
Leetcode 138. Copy List with Random Pointer
Using a hashmap to save the pairs,then set next and random link for new created nodes.O(n) time and space complexity.public class Solution { public RandomListNode copyRandomList(RandomListN原创 2017-03-08 04:37:57 · 176 阅读 · 0 评论 -
Leetcode 447. Number of Boomerangs
/** * Using a hashmap to save the pair of * Find all 2-permutations of N, P(n, 2) = n*(n-1) * Increase the count when distance is already in the map. * Sum up the count, another 2-permutations of原创 2017-01-12 06:29:06 · 220 阅读 · 0 评论 -
Leetcode 350. Intersection of Two Arrays II
/** * This problem allows duplicate, then we cannot use hashset. * Solution is using hashmap, the key would be the number in the array, * and the value is the number of times a key appeared. * O原创 2017-01-11 07:49:08 · 159 阅读 · 0 评论 -
349. Intersection of Two Arrays
/** * Sort the array, * then use two pointer. * Time O(nlongn) */ public class Solution { public int[] intersection(int[] nums1, int[] nums2) { // using set to avoid duplicates原创 2017-01-11 07:18:27 · 197 阅读 · 0 评论 -
Leetcode 202. Happy Number
public class Solution { public boolean isHappy(int n) { HashSet hs = new HashSet(); // if repeat, HashSet.add() will return false while (hs.add(n)) { // sum the原创 2017-01-09 13:17:35 · 200 阅读 · 0 评论 -
Leetcode 166. Fraction to Recurring Decimal
public class Solution { public String fractionToDecimal(int numerator, int denominator) { // determin the sign first // careful of the case n=0, d>0, so return 0 when numerator equ原创 2017-01-14 00:26:43 · 147 阅读 · 0 评论 -
Leetcode 187. Repeated DNA Sequences
public class Solution { public List findRepeatedDnaSequences(String s) { // the problem requires to find all substring that appear more than once // use a hashset to keep adding th原创 2017-01-14 10:10:42 · 144 阅读 · 0 评论 -
Leetcode 3. Longest Substring Without Repeating Characters
O(n)public class Solution { public int lengthOfLongestSubstring(String s) { HashSet hs = new HashSet(); int max = 0, fast = 0, slow = 0; while (fast < s.length()) {原创 2017-01-15 03:46:29 · 131 阅读 · 0 评论 -
Leetcode 76. Minimum Window Substring
public class Solution { public String minWindow(String s, String t) { int min = Integer.MAX_VALUE; String ret = ""; // assuming all characters are ASCII chars int[]原创 2017-01-15 03:57:33 · 215 阅读 · 0 评论 -
Leetcode 347. Top K Frequent Elements
public class Solution { public List topKFrequent(int[] nums, int k) { // set the value of treemap as list to handle when several numbers share a same frequency TreeMap> tm = new TreeMap<原创 2017-01-15 07:11:55 · 230 阅读 · 0 评论 -
205. Isomorphic Strings
/**1) If lengths of str1 and str2 are not same, return false.2) Do following for every character in str1 and str2 a) If this character is seen first time in str1, then current of str2 must原创 2017-01-11 02:40:15 · 149 阅读 · 0 评论 -
Leetcode 290. Word Pattern
public class Solution { public boolean wordPattern(String pattern, String str) { // split the str by " " and save it to a string array String[] arr = str.split(" "); if (pa原创 2017-01-11 05:36:17 · 168 阅读 · 0 评论 -
Leetcode 347. Top K Frequent Elements
Data structure used, hash table and min heap.A hashmap to save every element along with its frequency for the input data.A min heap to save top k most frequent map entry, comparing by map.value th原创 2017-04-06 03:38:05 · 224 阅读 · 0 评论