摘要：
Tcode: SLXT 阅读全文
摘要：
【MM】配置 - 在采购申请和采购订单上通过物料组带出总账科目 阅读全文
摘要：
MySQL学习之创建数据库表 阅读全文
摘要：
最近在看Spring in action这本书，在Ubuntu上配好了环境开始开发，没想到做了第二章的第一个例子就遇到了一个NoSuchMethodError错误。 阅读全文
摘要：
Explain how to implement doubly linked lists using only one pointer value x.np per
item instead of the usual two (next and prev). Assume that all pointer values can be
interpreted as k-bit integers, and define x.np to be x.np = x.next XOR x.prev,
the k-bit “exclusive-or” of x.next and x.prev. (The value NIL is represented by 0.)
Be sure to describe what information you need to access the head of the list. Show
how to implement the SEARCH, INSERT, and DELETE operations on such a list.
Also 阅读全文
摘要：
Give a Θ(n)-time nonrecursive procedure that reverses a singly linked list of n
elements. The procedure should use no more than constant storage beyond that
needed for the list itself. 阅读全文
摘要：
As written, each loop iteration in the LIST-SEARCH' procedure requires two tests:
one for x ≠ L.nil and one for x.key ≠ k. Show how to eliminate the test for
x ≠ L.nil in each iteration. 阅读全文
摘要：
Show how to implement a stack using two queues. Analyze the running time of the
stack operations. 阅读全文
摘要：
Show how to implement a queue using two stacks. Analyze the running time of the
queue operations. 阅读全文
摘要：
吸血鬼数字是指位数为偶数的数字，可以由一对数字相乘得到，而这对数字各包含乘积一半位数的数字，其中从最初数字中选取的数字可以任意排序。以两个0结尾的数字是不允许的。下面是一些吸血鬼数字：
15*93: 1395
21*60: 1260
21*87: 1827 阅读全文
摘要：
关于最大子数组问题三种解法的讨论： 1.暴力求解 2.分治求解 3.线性求解 阅读全文
摘要：
一些比较值得思考的小题，笔试题 阅读全文