缘ね花落的博客

区块链热身报告 16340296 张子权 以太坊的安装、私有链创世区块搭建、私有链节点的加入(选做) 安装以太坊 从http://ethereum.github.io/go-ethereum/downloads/ 下载安装Geth，可能需要在windows下添加环境变量。 私有链创世区块搭建 新建一个genesis.json，设置创世区块的难度,id等参数。新建文件夹data... 阅读全文…

45. Jump Game II week8 难度：Hard 题目链接 题目描述 Given an array of non-negative integers, you are initially positioned at the first index of the array. Each element in the array represents your maximum ... 阅读全文…

403. Frog Jump week7 难度：Hard 题目链接 题目描述 A frog is crossing a river. The river is divided into x units and at each unit there may or may not exist a stone. The frog can jump on a stone, but it mus... 阅读全文…

297. Serialize and Deserialize Binary Tree week6 难度：Hard 题目链接 题目描述 Serialization is the process of converting a data structure or object into a sequence of bits so that it can be stored in a fil... 阅读全文…

24 Game week5 难度：Hard 题目链接 题目描述 You have 4 cards each containing a number from 1 to 9. You need to judge whether they could operated through *, /, +, -, (, ) to get the value of 24. Example1: ... 阅读全文…

Binary Tree Maximum Path Sum week4 难度：Hard 题目链接 题目描述 Given a non-empty binary tree, find the maximum path sum. For this problem, a path is defined as any sequence of nodes from some starting nod... 阅读全文…

Binary Tree Postorder Traversal week3 难度：Hard 题目链接 题目描述 Given a binary tree, return the postorder traversal of its nodes’ values. Example: Input: [1,null,2,3] 1 \ 2 ... 阅读全文…

Couples Holding Hands week 2 题目链接 题目描述 N couples sit in 2N seats arranged in a row and want to hold hands. We want to know the minimum number of swaps so that every couple is sitting side by sid... 阅读全文…

数值计算实验 实验一 1.问题描述 求解线性方程组 Ax=b，其中 A 为 nⅹn 维的已知矩阵，b 为 n 维的已知向量，x 为 n 维的未知向量。 A 与 b 中的元素服从独立同分布的正态分布。令 n=10、50、100、200，测试计算时间并绘制曲线。 （1）高斯消去法。 （2）列主元消去法。 2.算法设计 高斯消去法 （1）消元：使用逐次消去未知数的方法把原线性方程组A... 阅读全文…

Sort Colors week1 题目链接 题目描述 Given an array with n objects colored red, white or blue, sort them in-place so that objects of the same color are adjacent, with the colors in the order red, white a... 阅读全文…