Git 教程 (4) - 多人协作

Read More

Git 教程 (2) - 分支管理

Read More

Git 教程 (1) - 基本使用

Read More

C++ - 模板

Read More

C++ - vector

Read More

C++11 - auto

Read More

LeetCode - 46

Problem description

Read More

LeetCode - 34

Problem description

Given an array of integers nums sorted in ascending order, find the starting and ending position of a given target value.

Read More

LeetCode - 278

Problem description

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 bad version are also bad.

Read More

LeetCode - 35

Problem description

Given a sorted array and a target value, return the index if the target is found. If not, return the index where it would be if it were inserted in order.

Read More