STL
hushhw
这个作者很懒,什么都没留下…
展开
-
24点
题目内容: 问题描述:输入4个数,通过 加、减、乘、除运算看能否得到 结果 24,每个数只用一次。输入描述输入四个正整数输出描述能通过某种方式得到24则输出1,不能则输出0输入样例6 6 6 6输出样例1思路:因为只有四个数,外面套了一个全排列,对四个数进行排列,里面套了三个循环穷举出所有的结合情况,因为所有情况都穷举出来了,所以原创 2017-10-31 19:36:15 · 616 阅读 · 0 评论 -
ZOJ Problem Set - 2104 Let the Balloon Rise(map)
Let the Balloon RiseTime Limit: 2 Seconds Memory Limit: 65536 KBContest time again! How excited it is to see balloons floating around. But to tell you a secret, the judges' favorite tim原创 2017-11-27 21:49:18 · 366 阅读 · 0 评论 -
ZOJ Problem Set - 1094 Matrix Chain Multiplication
Matrix Chain MultiplicationTime Limit: 2 Seconds Memory Limit: 65536 KBMatrix multiplication problem is a typical example of dynamical programming.Suppose you have to evaluate an expr原创 2017-11-27 19:13:34 · 226 阅读 · 0 评论 -
ZOJ Problem Set - 1004 Anagrams by Stack
Anagrams by StackTime Limit: 2 Seconds Memory Limit: 65536 KBHow can anagrams result from sequences of stack operations? There are two sequences of stack operators which can conve原创 2017-11-27 19:16:34 · 356 阅读 · 0 评论 -
ZOJ Problem Set - 1016 Parencodings
ParencodingsTime Limit: 2 Seconds Memory Limit: 65536 KBLet S = s1 s2 ... s2n be a well-formed string of parentheses. S can be encoded in two different ways:By an integer sequence原创 2017-11-27 20:48:39 · 301 阅读 · 0 评论 -
ZOJ Problem Set - 1944 Tree Recovery(二叉树三种遍历知二求三)
Tree RecoveryTime Limit: 2 Seconds Memory Limit: 65536 KBLittle Valentine liked playing with binary trees very much. Her favorite game was constructing randomly looking binary trees with原创 2017-11-27 21:30:32 · 373 阅读 · 0 评论 -
全排列算法总结
本文同时发布在我的个人博客:https://wiki.hushhw.cn/posts/83505976.html全排列递归算法算法思想求 n 位的字符串的全排列,先确定第 0 位,然后对后面 n-1 位进行全排列,在对 n-1 为进行全排列时,先确定第 1 位,然后对后面的 n-2 位进行全排列...由此得到递归函数和递归的结束条件。全排列也就是交换位置,到 n-2 位时,就是将 ...原创 2017-09-27 14:45:39 · 15819 阅读 · 0 评论