Branch

经过之前《认真配眼镜（一）之验光篇》和《认真配眼镜（二）之镜架选购篇》这两篇文章的介绍，拿到靠谱的验光数据和合适的眼镜架后，最后一步就是进行镜片加工，得到最终的近视眼镜。 镜...

Branch

博主你好，从数组建堆的复杂度应该是O(N)？参考Robert Sedgewick的《Algorithm》第四版

手把手教你写个大顶堆

今天我们来实现一个大顶堆，所谓大顶堆，即根节点的值大于等于其孩子节点的值。废话少絮，直接开始。 堆是一个完全二叉树，很适合用顺序结构来实现，这里我们选择数组。用数组实现堆时，...

刘尐六

8817 2 1

Branch

Problem In task scheduling, it is common to use a graph representation with a node for ...

Branch

Problem Given a non-negative integer n, count all numbers with unique digits, x, where ...

Branch

Problem Suppose you have N integers from 1 to N. We define a beautiful arrangement as a...

Branch

Problem There are a total of n courses you have to take, labeled from 0 to n - 1.Some c...

Branch

Problem There are a total of n courses you have to take, labeled from 0 to n - 1.Some c...

Branch

Problem Given a 2d grid map of '1's (land) and '0's (water), count the number of island...

Branch

Problem A sequence of number is called arithmetic if it consists of at least three elem...

Branch

Problem Say you have an array for which the ith element is the price of a given stock o...

Branch

Problem You are a professional robber planning to rob houses along a street. Each house...

Branch

Problem Given an integer array nums, find the sum of the elements between indices i and...

Branch

Problem Given a non negative integer number num. For every numbers i in the range 0 ≤ i...

Branch

Problem Say you have an array for which the ith element is the price of a given stock o...