bachelorchen的专栏

http://community.topcoder.com/tc?module=Static&d1=tutorials&d2=bitManipulation iterate over all the subsets of a particular subset (represented by a bit pattern) So the iteration step is just i

two hash functions/* And a case insensitive hash function (based on djb hash) */unsigned int dictGenCaseHashFunction(const unsigned char *buf, int len) { unsigned int hash = (unsigned int)dict_

Pattern recognition and machine learningPrin

The t_zset.c contains the sorted set code.work to do:

The following are either implementations, "napkin designs" or discussions of LRU caches in C++:http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.88.7296&rep=rep1&type=pdfhttp://www.bott

第一次在 redis 的 dict 源码中看到这种用法。

https://oj.leetcode.com/problems/3sum/class Solution: # @return a list of lists of length 3, [[val1,val2,val3]] def threeSum(self, num): num.sort() lst = [] n = len(n

https://oj.leetcode.com/problems/3sum-closest/class Solution: # @return an integer def threeSumClosest(self, num, target): num.sort() n = len(num) if (n < 3): return

Palindrome Numberclass Solution: # @return a boolean def isPalindrome(self, x): if x < 0: return False y, z = 0, x while z: y = y * 10 + z % 10

Symmetric Tree# Definition for a binary tree node# class TreeNode:# def __init__(self, x):# self.val = x# self.left = None# self.right = Noneclass Solution:

insert-interval# Definition for an interval.# class Interval:# def __init__(self, s=0, e=0):# self.start = s# self.end = eclass Solution: # @param intervals, a list of

Gas Stationclass Solution: # @param gas, a list of integers # @param cost, a list of integers # @return an integer def canCompleteCircuit(self, gas, cost): n = len(gas)

Remove Duplicates from Sorted Arrayclass Solution: # @param a list of integers # @return an integer def removeDuplicates(self, A): n = len(A) if n <= 1: return n

https://oj.leetcode.com/problems/repeated-dna-sequences/class Solution: # @param s, a string # @return a list of strings def findRepeatedDnaSequences(self, s): map2Int = {'A':0,

Excel Sheet Column Titleclass Solution: # @return a string def convertToTitle(self, num): s = "" while num > 0: r = (num - 1) % 26 + 1 s = chr(ord

Median of Two Sorted Arraysclass Solution: # @return an element from A or B def findKth(self, A, B, k): n, m = len(A), len(B) if n == 0: return B[k - 1] if m == 0:

Balanced Binary Tree# Definition for a binary tree node# class TreeNode:# def __init__(self, x):# self.val = x# self.left = None# self.right = Nonecla

Valid Parenthesesclass Solution: # @return a boolean def isValid(self, s): st = [] for x in s: if x in ('(', '[', '{'): st.append(x) e

Find Peak Elementclass Solution: # @param num, a list of integer # @return an integer def findPeakElement(self, num): n = len(num) if n <= 1: return 0

Next Permutationclass Solution: # @param num, a list of integer # @return a list of integer def nextPermutation(self, num): if len(num) < 2: return num n = len(num)

Remove Elementclass Solution: # @param A a list of integers # @param elem an integer, value need to be removed # @return an integer def removeElement(self, A, elem):

Reverse Words in a Stringclass Solution: # @param s, a string # @return a string def reverseWords(self, s): return ' '.join(s.split()[::-1])

Unique Pathsclass Solution: # @return an integer def uniquePaths(self, m, n): numerator, denominator = 1, 1 for i in range(m - 1): numerator *= i + 1

Copy List with Random Pointer# Definition for singly-linked list with a random pointer.# class RandomListNode:# def __init__(self, x):# self.label = x# self.next = None#

Surrounded Regionsclass Solution: # @param board, a 2D array # Capture all regions by modifying the input board in-place. # Do not return any value. def solve(self, board):

Longest Valid Parenthesesclass Solution: # @param s, a string # @return an integer def longestValidParentheses(self, s): ret, st = 0, [] st.append((-1,')')) for

Sqrt(x)class Solution: # @param x, an integer # @return an integer def sqrt(self, x): if x <= 1: return x low, high = 1, x while low < high:

Spiral Matrixclass Solution: # @param matrix, a list of lists of integers # @return a list of integers def spiralOrder(self, matrix): n = len(matrix) if n == 0: return []

Box stacking: You are given a set of boxes {b1, ..., bn}. Each box bj has an associated width wj ,height hj and depth dj . Give an algorithm for creating the highest possible stack of boxes with the

Maximum Subarrayclass Solution {public: int maxSubArray(int A[], int n) { int ans = 0, cs = 0; if (n == 0) return 0; ans = cs = A[0]; for (int i = 1; i < n; ++

Interleaving Stringclass Solution {public: bool isInterleave(string s1, string s2, string s3) { int n = s1.length(), m = s2.length(), l3 = s3.length(); if (n + m != l3)

Valid Parenthesesclass Solution {public: bool leftBrace(char ch) { return ch == '(' || ch == '{' || ch == '['; } bool isMatch(char lc, char rc) { return lc == '(' && r

Palindrome Partitioning IIclass Solution {public: int minCut(string s) { int n = s.length(); if (n <= 1) return 0; vector > dp; dp.resize(n); for (int

Sort Colorsclass Solution {public: void swap(int &a, int &b) { int c = a; a = b; b = c; } void sortColors(int A[], int n) { const int red = 0, white =

Median of Two Sorted Arraysclass Solution {public: int findkth(int* A, int m, int* B, int n, int k) { if (m + n < k) { return -1; //out of range } if (m ==

POJ 1470 Closest Common AncestorsWiki 上的 Tarjan 算法, Tarjan is an offline algorithmhttp://en.wikipedia.org/wiki/Tarjan's_off-line_lowest_common_ancestors_algorithmfunction TarjanOLCA(u) Ma

Path Sum II/** * Definition for binary tree * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * };

Scramble Stringclass Solution {public: bool isScramble2(string s1, string s2) { int n = s1.length(); if (n <= 3) return true; //from left int match = 0;

Decode Waysclass Solution: # @param s, a string # @return an integer def numDecodings(self, s): n = len(s) if n == 0: return 0 if n == 1: if '1' <=

Remove Elementclass Solution: # @param A a list of integers # @param elem an integer, value need to be removed # @return an integer def removeElement(self, A, elem):