Skip to content

Instantly share code, notes, and snippets.

View HoweChen's full-sized avatar
🎯
Focusing

Yuhao.Chen (Howe) - 陈雨豪 HoweChen

🎯
Focusing
14 followers · 8 following
View GitHub Profile
@HoweChen
HoweChen / 列表里寻找重复项.md
Created March 13, 2019 06:45
[列表操作] #Algorithm
  1. 用set
  2. 排序后从第一项开始跟前一项比较 （最慢）
  3. 用 python collections.Counter 统计出现次数 （次快，可以知道出现次数）
  4. 用一个 boolean 列表来看看这个数字是否见过 （最快，但是无法知道出现次数）
class Solution:
    def findDuplicates(self, nums: List[int]) -> List[int]:
        # method 1: set
@HoweChen
HoweChen / Solution.md
Created March 10, 2019 07:50
[斐波那契数列几种解法] #Algorithm

Solution 1: Iterative

Time complexity: O(n) Space complexity: O(1)

class Solution
{
    public int fib(int N)
    {
@HoweChen
HoweChen / list_with_initNum.py
Created March 10, 2019 07:41
[Initiate new list with default value]Initiage new list with default value #Python
target_num = 0
length = 100
# two methods
# 1
a = [target_num for x in range(length)]
# 2
b = [target_num] * length
@HoweChen
HoweChen / Python extract column to a new list.py
Created March 6, 2019 13:26
[Python extract column to a new list]Python extract Column to a new list #Python
#从一个列表中提取每一行的列作为新的列表
a=["cba","daf","ghi"]
a=list(zip(*a))
print(a) # [('c', 'd', 'g'), ('b', 'a', 'h'), ('a', 'f', 'i')]
@HoweChen
HoweChen / python_timing_wrapper.py
Last active February 20, 2019 09:25
[Python timing wrapper]The python timing wrapper #Python
from functools import wraps
from time import time
def timing(f):
@wraps(f)
def wrap(*args, **kw):
ts = time()
result = f(*args, **kw)
te = time()
print(
@HoweChen
HoweChen / opencv_from_base64.py
Last active August 6, 2024 19:03
[opencv_from_base64]read image from opencv with base64 encoding #OpenCV
import cv2
import numpy as np
import base64
image = "" # raw data with base64 encoding
decoded_data = base64.b64decode(image)
np_data = np.fromstring(decoded_data,np.uint8)
img = cv2.imdecode(np_data,cv2.IMREAD_UNCHANGED)
cv2.imshow("test", img)
cv2.waitKey(0)
@HoweChen
HoweChen / inorder_BST.py
Last active March 14, 2019 08:50
[inorderBST]using yield and yiled from #Python #Algorithm
class Solution:
def increasingBST(self, root):
def inorder(node):
if node:
# 这里用了yield 和 yield from
# yield from 作为递归
# yield 返回值
# 这是一个左中右的 inorder 遍历
# 返回一个 generator
yield from inorder(node.left)