NOTE


  • 首页

  • 分类

  • 关于

  • 归档

  • 标签

Java 多线程

发表于 2016-08-12   |   分类于 Study Notes , Java Multithreading

线程,由线程ID,当前指令指针,寄存器集合,以及堆栈组成。一个进程内可以包含多个线程,线程之间可以共享资源

阅读全文 »

Binary Tree Preorder Traversal

发表于 2016-08-11   |   分类于 LeetCode , Tree

Given a binary tree, return the preorder traversal of its nodes’ values.

阅读全文 »

堆排序

发表于 2016-08-10   |   分类于 Study Notes , Sort , Heapsort

The heapsort algorithm involves preparing the list by first turning it into a max heap. The algorithm then repeatedly swaps the first value of the list with the last value, decreasing the range of values considered in the heap operation by one, and sifting the new first value into its position in the heap. This repeats until the range of considered values is one value in length. - - - - wikipedia

阅读全文 »

快速排序

发表于 2016-08-09   |   分类于 Study Notes , Sort , Quicksort

Quicksort is a divide and conquer algorithm. Quicksort first divides a large array into two smaller sub-arrays: the low elements and the high elements. Quicksort can then recursively sort the sub-arrays. - - - - wikipedia

阅读全文 »

Best, worst and average case

发表于 2016-08-09   |   分类于 Study Notes , Summarize

排序算法和数据结构的最好,最差,平均情况,详情: wikipedia

阅读全文 »
1…91011…13
denglyan

denglyan

めざせポケモンマスター

63 日志
31 分类
26 标签
© 2016 - 2018 denglyan
由 Hexo 强力驱动
主题 - NexT.Mist