LeetCode

Implement skip list in python import random class SkipNode: def __init__(self, key=None, value=None, level=0): self.key = key self.value = value self.forward = [None] * level class SkipList: def __init__(self, max_level=16): self.head = SkipNode() self.max_level = max_level self.level = 0 def random_level(self): level = 1 while random.random() < 0.5 and level < self.max_level: level += 1 return level def search(self, key): node = self.head for i in range(self.level-1, -1, -1): while

01 背包问题的模版 // 01背包 for (int i = 0; i < n; i++) { for (int j = m; j >= V[i]; j--) { f[j] = max(f[j], f[j-V[i]] + W[i]); } } // 完全背包 for (int i = 0; i < n; i++) { for (int j = V[i]; j <= m; j++) { f[j] = max(f[j], f[j-V[i]]