INSERT GRAPHIC HERE (include hyperlink in image)
Subtitle or Short Description Goes Here
比原最近的 PR #1356 新增了链式交易功能。 可以将多笔 utxo 合并成链并立即直接使用。
注意:目前只支持 spend btm 资产
重点代码在 account/builder.go
//流程: 
| { | |
| "title": "区块链工程师面试宝典", | |
| "author": "Haoyu LIN", | |
| "output.name": "site", | |
| "gitbook": "3.2.3", | |
| "root": "./", | |
| "styles": { | |
| "website": "styles/website.css" | |
| }, | |
| "plugins": [ | 
| //Leetcode 124. Binary Tree Maximum Path Sum | |
| //crab's code. I can never understand, but it works at the end? | |
| //why?why?why??? | |
| /** | |
| * Definition for binary tree | |
| * public class TreeNode { | |
| * int val; | |
| * TreeNode left; | |
| * TreeNode right; | 
| //Leetcode 124. Binary Tree Maximum Path Sum | |
| //crab's code. I can never understand, but it works at the end? | |
| //why?why?why??? | |
| /** | |
| * Definition for binary tree | |
| * public class TreeNode { | |
| * int val; | |
| * TreeNode left; | |
| * TreeNode right; | 
| var util =require('util'); | |
| var fs = require('fs'); | |
| var urlencode = require('urlencode'); | |
| function init() { | |
| fs.writeFileSync('test.md', '# SST 2017\n\n'); | |
| } | |
| function append(str) { | |
| fs.appendFileSync('test.md', str); |