Michael's Blog

How to set environment variables in Jupyter notebook

In some cases you would like to share some configuration information, such as API keys, database credentials etc, between different Jupyter notebooks without exposing sensitive information, you could achieve this by using environment variables. You can create a .env file in the same directory as your Jupyter notebook on your

How to install Stable Diffusion on Mac

This blog post just talk about how to install Stable Diffusion web UI [https://github.com/AUTOMATIC1111/stable-diffusion-webui] on Mac if you would like to run it locally. 1. Install Homebrew [https://brew.sh/] if you have not installed it before by running the following command in terminal /bin/bash

LeetCode

Binary Tree Preorder Traversal

144. Binary Tree Preorder Traversal [https://leetcode.com/problems/binary-tree-preorder-traversal/?tab=Description] Given a binary tree, return the preorder traversal of its nodes' values. For example: Given binary tree {1,#,2,3}, 1 \ 2 / 3 return [1,2,3]. Note: Recursive solution is trivial, could you do it iteratively? class

LeetCode

Kth Smallest Element in a Sorted Matrix

378. Kth Smallest Element in a Sorted Matrix [https://leetcode.com/problems/kth-smallest-element-in-a-sorted-matrix/description/] Given a n x n matrix where each of the rows and columns are sorted in ascending order, find the kth smallest element in the matrix. Note that it is the kth smallest element in the

LintCode

Flatten 2D Vector

601. Flatten 2D Vector [https://www.lintcode.com/en/old/problem/flatten-2d-vector/] Implement an iterator to flatten a 2d vector. Example Given 2d vector = [ [1,2], [3], [4,5,6] ] By calling next repeatedly until hasNext returns false, the order of elements returned by next should be: [1,2,3,

LeetCode

Binary Tree Inorder Traversal

94. Binary Tree Inorder Traversal [http://www.lintcode.com/en/problem/binary-tree-inorder-traversal] Given a binary tree, return the inorder traversal of its nodes' values. For example: Given binary tree [1,null,2,3], 1 \ 2 / 3 return [1,3,2]. Note: Recursive solution is trivial, could you do it iteratively?

LeetCode

Minimum Window Substring

76. Minimum Window Substring [https://leetcode.com/problems/minimum-window-substring/] LintCode-32.Minimum Window Substring [http://www.lintcode.com/en/problem/minimum-window-substring/] Given a string S and a string T, find the minimum window in S which will contain all the characters in T in complexity O(n). For example, S = "ADOBECODEBANC"

LeetCode

First Bad Version

278. First Bad Version [https://leetcode.com/problems/first-bad-version/] You are a product manager and currently leading a team to develop a new product. Unfortunately, the latest version of your product fails the quality check. Since each version is developed based on the previous version, all the versions after a

LeetCode

Implement Trie (Prefix Tree)

208. Implement Trie (Prefix Tree) [https://leetcode.com/problems/implement-trie-prefix-tree/] LintCode-442.Implement Trie [http://www.lintcode.com/en/problem/implement-trie/] Implement a trie with insert, search, and startsWith methods. Note: You may assume that all inputs are consist of lowercase letters a-z. class TrieNode { private var children: [TrieNode?] = [] public var

LeetCode

Word Search

79. Word Search [https://leetcode.com/problems/word-search/] LintCode-123.Word Search [http://www.lintcode.com/en/problem/word-search/] Given a 2D board and a word, find if the word exists in the grid. The word can be constructed from letters of sequentially adjacent cell, where "adjacent" cells are those horizontally

LeetCode

Basic Calculator

224. Basic Calculator [https://leetcode.com/problems/basic-calculator/] Implement a basic calculator to evaluate a simple expression string. The expression string may contain open ( and closing parentheses ), the plus + or minus sign -, non-negative integers and empty spaces . You may assume that the given expression is always valid. Some examples:

Display Page list

实现分页显示。给了以下一些输入数据，要求将以下行分页显示，每页12行，其中每行已经按score排好序，分页显示的时候如果有相同host id的行，则将后面同host id的行移到下一页。 import java.io.; import java.util.; class Solution { public static void main(String[] args) { List input = new ArrayList<>(); input.add("1,28,300.1,SanFrancisco"); input.add("4,5,209.1,SanFrancisco"); input.add("20,7,208.1,SanFrancisco"); input.add(

LeetCode

Brick Wall

554. Brick Wall [https://leetcode.com/problems/brick-wall/] There is a brick wall in front of you. The wall is rectangular and has several rows of bricks. The bricks have the same height but different width. You want to draw a vertical line from the top to the bottom and

LeetCode

Sort Colors

75. Sort Colors [https://leetcode.com/problems/sort-colors/] LintCode-148.Sort Colors [http://www.lintcode.com/en/problem/sort-colors/] Given an array with n objects colored red, white or blue, sort them so that objects of the same color are adjacent, with the colors in the order red, white and blue.

LeetCode

Add and Search Word

211. Add and Search Word - Data structure design [https://leetcode.com/problems/add-and-search-word-data-structure-design/] LintCode-473.Add and Search Word [http://www.lintcode.com/en/problem/add-and-search-word/] Design a data structure that supports the following two operations: void addWord(word) bool search(word) search(word) can search a literal word or

LintCode

Sort Colors II

LintCode-143.Sort Colors II [http://www.lintcode.com/en/problem/sort-colors-ii/] Given an array of n objects with k different colors (numbered from 1 to k), sort them so that objects of the same color are adjacent, with the colors in the order 1, 2, ... k. Notice: You are not

LeetCode

Missing Ranges

163. Missing Ranges [https://leetcode.com/problems/missing-ranges/] Given a sorted integer array where the range of elements are in the inclusive range [lower, upper], return its missing ranges. For example, given [0, 1, 3, 50, 75], lower = 0 and upper = 99, return ["2", "4->49", "51->74", "76->99"

LeetCode

Moving Average from Data Stream

346. Moving Average from Data Stream [https://leetcode.com/problems/moving-average-from-data-stream/] Given a stream of integers and a window size, calculate the moving average of all integers in the sliding window. For example, MovingAverage m = new MovingAverage(3); m.next(1) = 1 m.next(10) = (1 + 10) / 2 m.next(

LeetCode

Strobogrammatic Number

246. Strobogrammatic Number [https://leetcode.com/problems/strobogrammatic-number/description/] A strobogrammatic number is a number that looks the same when rotated 180 degrees (looked at upside down). Write a function to determine if a number is strobogrammatic. The number is represented as a string. For example, the numbers "69", "88"

LeetCode

Zigzag Iterator

281. Zigzag Iterator [https://leetcode.com/problems/zigzag-iterator/] Given two 1d vectors, implement an iterator to return their elements alternately. For example, given two 1d vectors: v1 = [1, 2] v2 = [3, 4, 5, 6] By calling next repeatedly until hasNext returns false, the order of elements returned by next should

LeetCode

Plus One

66. Plus One [https://leetcode.com/problems/plus-one/] Given a non-negative integer represented as a non-empty array of digits, plus one to the integer. You may assume the integer do not contain any leading zero, except the number 0 itself. The digits are stored such that the most significant digit

LeetCode

Decode String

394. Decode String [https://leetcode.com/problems/decode-string/description/] Given an encoded string, return it's decoded string. The encoding rule is: k[encoded_string], where the encoded_string inside the square brackets is being repeated exactly k times. Note that k is guaranteed to be a positive integer. You may

LeetCode

License Key Formatting

482. License Key Formatting [https://leetcode.com/problems/license-key-formatting/] Now you are given a string S, which represents a software license key which we would like to format. The string S is composed of alphanumerical characters and dashes. The dashes split the alphanumerical characters within the string into groups. (i.

LeetCode

Strobogrammatic Number II

247. Strobogrammatic Number II [https://leetcode.com/problems/strobogrammatic-number-ii] A strobogrammatic number is a number that looks the same when rotated 180 degrees (looked at upside down). Find all strobogrammatic numbers that are of length = n. For example, Given n = 2, return ["11","69","88","96"]. n = 0: none n

LintCode

Consistent Hashing II

Consistent Hashing II [http://lintcode.com/en/problem/consistent-hashing-ii/] 在 Consistent Hashing I 中我们介绍了一个比较简单的一致性哈希算法，这个简单的版本有两个缺陷： 1. 增加一台机器之后，数据全部从其中一台机器过来，这一台机器的读负载过大，对正常的服务会造成影响。 2. 当增加到3台机器的时候，每台服务器的负载量不均衡，为1:1:2。为了解决这个问题，引入了 micro-shards 的概念，一个更好的算法是这样： 1. 将 360° 的区间分得更细。从 0~359 变为一个 0 ~ n-1 的区间，将这个区间首尾相接，连成一个圆。 2. 当加入一台新的机器的时候，随机选择在圆周中撒 k 个点，代表这台机器的