排序:
默认
按更新时间
按访问量

LFU cache Java

public class LFUCache {     HashMap hashtable = new HashMap();     int column;     PriorityQueue priorityQueue;          public LFUCache(int cap...

2016-07-24 11:53:36

阅读数:364

评论数:0

leetcode: Word Pattern

Given a pattern and a string str, find if str follows the same pattern. Here follow means a full match, such that there is a bijection between a...

2015-10-12 03:11:09

阅读数:230

评论数:0

开始刷leetcode day79:Rectangle Area

Find the total area covered by two rectilinear rectangles in a 2D plane. Each rectangle is defined by its bottom left corner and top right corner ...

2015-07-28 13:00:33

阅读数:235

评论数:0

测试server是否block port或者网站

网站: paping apitest.authorize.net -p 443 or ping api.test.authorize.net SMTP port 25 blocked or not telnet my-domain-name.com 25

2015-07-28 03:40:19

阅读数:547

评论数:0

开始刷leetcode day78:Binary Search Tree Iterator

Implement an iterator over a binary search tree (BST). Your iterator will be initialized with the root node of a BST. Calling next() will return t...

2015-07-27 12:21:44

阅读数:208

评论数:0

开始刷leetcode day78:Lowest Common Ancestor of a Binary Tree

Given a binary tree, find the lowest common ancestor (LCA) of two given nodes in the tree. According to the definition of LCA on Wikipedia: “The l...

2015-07-27 11:37:26

阅读数:222

评论数:0

在windows server 2008 R2上运行disk cleanup

通常情况下可以在开始-〉Accessories->system tools 里直接找到Disk cleanup 但是在windows server 2008 R2里, 找不到。 为了可以使用cleanmgr, 需要复制两个文件:cleanmgr.exe, cleanmgr.exe...

2015-07-24 02:17:25

阅读数:3300

评论数:0

读书笔记 day1:The design of approximation algorithms

Chapter 1 As P not equal to NP, we cannot simultaneously have algorithms that 1. find optimal solutions; 2. in polynomial time; 3. for any insta...

2015-07-23 05:53:58

阅读数:385

评论数:0

Bug record1: The underlying connection was closed: The connection was closed unexpectedly.Then

Description: Setting up a c# console form for testing another web service called api.svc. After running the web service and make sure it is running...

2015-07-23 00:33:28

阅读数:553

评论数:0

开始刷leetcode day72: Binary Tree Preorder Traversal

Given a binary tree, return the preorder traversal of its nodes' values. For example: Given binary tree {1,#,2,3}, 1 \ 2 / ...

2015-07-20 10:40:49

阅读数:175

评论数:0

开始刷leetcode day72:Binary Tree Postorder Traversal

Given a binary tree, return the postorder traversal of its nodes' values. For example: Given binary tree {1,#,2,3}, 1 \ 2 / ...

2015-07-20 10:33:46

阅读数:149

评论数:0

开始刷leedtcode day72:Product of Array Except Self

Given an array of n integers where n > 1, nums, return an array output such that output[i] is equal to the product of all the elements of nums e...

2015-07-20 09:57:42

阅读数:341

评论数:0

开始刷leetcode day72: Kth Smallest Element in a BST

Given a binary search tree, write a function kthSmallest to find the kth smallest element in it. Note:  You may assume k is always valid, 1 ≤ k...

2015-07-20 09:14:53

阅读数:298

评论数:0

开始刷leetcode day71:Delete Node in a Linked List

Write a function to delete a node (except the tail) in a singly linked list, given only access to that node. Supposed the linked list is 1 -> 2 -...

2015-07-19 10:48:42

阅读数:412

评论数:0

开始刷leetcode day71:Summary Ranges

Given a sorted integer array without duplicates, return the summary of its ranges. For example, given [0,1,2,4,5,7], return ["0->2",&...

2015-07-19 10:43:03

阅读数:146

评论数:0

开始刷leetcode day71: Power of Two

Given an integer, write a function to determine if it is a power of two. Credits: Special thanks to @jianchao.li.fighter for adding this problem ...

2015-07-19 10:09:56

阅读数:233

评论数:0

funny makeup story

Yun's Post Apocalyptic Blog Entry 1:  Day 1 Hour 1:  It's lonely in here. I didn't think the apocalypse would come in the form of coffee zo...

2015-07-18 02:31:45

阅读数:391

评论数:0

开始刷leetcode day63:House Robber II

Note: This is an extension of House Robber. After robbing those houses on that street, the thief has found himself a new place for his thievery so...

2015-07-13 06:42:12

阅读数:186

评论数:0

开始刷leetcode day63:Contains Duplicate III

Given an array of integers, find out whether there are two distinct indices i and j in the array such that the difference between nums[i] and nums[...

2015-07-13 06:04:55

阅读数:165

评论数:0

开始刷leetcode day63:Contains Duplicate II

Given an array of integers and an integer k, find out whether there there are two distinct indices i and j in the array such that nums[i] = nums[...

2015-07-13 05:28:51

阅读数:126

评论数:0

提示
确定要删除当前文章?
取消 删除
关闭
关闭