cheetach的专栏

Problem: Suppose that we are given a sequence of n values x1, x2, ..., xn and seek to quickly answer repeated queries of the form:given i and j, find the smallest value in xi, ...., xj.1.  Desig

Problem:Design a data structure that allows one to search, insert, and delete an integerX in O(1) time (i.e. , constant time, independent of the total number of integersstored). Assume that 1 ≤

For most puzzles, if we can understand what the question says, we will be able to give a direct answer. But that simple answer is always not so good in terms of efficiency.Sometimes this is because

This is my own summary of the contest, mainly to give myself advice on how to make me faster on the next contest.1. Bad horse.     Situation: This is a simple graph traversal problem. I used 34 mi

My understanding of Leetcode 'Single Number II'

Question link: http://oj.leetcode.com/problems/populating-next-right-pointers-in-each-node-ii/Follow up for problem "Populating Next Right Pointers in Each Node".What if the given tree could

Problem:find the longest consecutive substring of two string S, K. Use DP.Solution:    Matrix: m[m][n]        m[i][j] = 0, if Si != Kj;        m[i][j] = m[i-1][j-1] + 1 if Si == Kj;