单链表是一种链式存储结构，它可以通过一组任意的存储单元来存储线性表中的数据元素。头文件
声明//// linklist.h// Datastructure//// Created by zhou on 14-5-25.// Copyright
(c) 2014年 zhou. All righ...
分类：
其他好文 时间：
2014-05-25 20:06:02
阅读次数：
227
有二种方式波形文件显示的数值的进制，第一种是直接修改配置文件，第二种是使用do文件时，指定波形的显示进制第一种方法：可以通过修改modelsim安装目录下面的modelsim.ini文件里面的DefaultRadix
值实现; Default radix for all windows and co...
分类：
其他好文 时间：
2014-05-25 18:45:59
阅读次数：
472
Problem DescriptionIn your childhood, do you
crazy for collecting the beautiful cards in the snacks? They said that, for
example, if you collect all t...
分类：
其他好文 时间：
2014-05-25 14:05:37
阅读次数：
214
【题目】
Given a set of non-overlapping intervals, insert a new interval into the intervals (merge if necessary).
You may assume that the intervals were initially sorted according to their start times.
Example 1:
Given intervals [1,3],[6,9], insert and mer...
分类：
其他好文 时间：
2014-05-25 12:56:43
阅读次数：
271
Problem Description
Have you ever played quoit in a playground? Quoit is a game in which flat rings are pitched at some toys, with all the toys encircled awarded.
In the field of Cyberground, the ...
分类：
其他好文 时间：
2014-05-25 11:13:53
阅读次数：
245
Problem Description
We have a special convex that all points have the same distance to origin point.
As you know we can get N segments after linking the origin point and the points on the convex. ...
分类：
其他好文 时间：
2014-05-25 09:50:19
阅读次数：
217
寻找图中最小连通的路径，图如下：
算法步骤：
1. Sort all the edges in non-decreasing order of their weight.
2. Pick the smallest edge. Check if it forms a cycle with the spanning tree
formed so far. If cycle is n...
分类：
其他好文 时间：
2014-05-25 07:35:59
阅读次数：
301
clear all
A4=440;%标准音A4 不同的曲调音调不同scale的取值范围不同
pt=44100;p0=pt/2;%频率
scale=A4/2^(9/12)*2.^((-12:11)/12);%这里可以调节音调高低，eg：改变式子中的-12：11为0：23
map=[1 3 5 6 8 10 12 13 15 17 18 20 22 24 25];%音符，这个需要看曲谱编码...
分类：
其他好文 时间：
2014-05-25 07:27:55
阅读次数：
1212
Problem Description
We have a special convex that all points have the same distance to origin point.
As you know we can get N segments after linking the origin point and the points on the convex. ...
分类：
其他好文 时间：
2014-05-25 06:55:54
阅读次数：
188
【题目】
The set [1,2,3,…,n] contains a total of n! unique permutations.
By listing and labeling all of the permutations in order,
We get the following sequence (ie, for n = 3):
"123"
"132"
"213"
"231"
"312"
"321"
Given n and k, return the kth permutation ...
分类：
其他好文 时间：
2014-05-25 06:13:37
阅读次数：
276
