• Home

  • Tags

  • Categories

  • Archives

5. Longest Palindromic Substring

Posted on 2018-11-11 | In 算法 | leetcode
Words count in article: 682 | Reading time ≈ 3
题目 Given a string s, find the longest palindromic substring in s. You may assume that the maximum length of s is 1000. Example 123Input: "babad& ...
Read more »

41. First Missing Positive

Posted on 2018-11-10 | In 算法 | leetcode
Words count in article: 579 | Reading time ≈ 2
题目 Given an unsorted integer array, find the smallest missing positive integer. Example: 12Input: [7,8,9,11,12]Output: 1 Note: Your algorithm should ...
Read more »

8. String to Integer (atoi)

Posted on 2018-11-10 | In 算法 | leetcode
Words count in article: 423 | Reading time ≈ 2
题目Implement atoi which converts a string to an integer. The function first discards as many whitespace characters as necessary until the first non-whi ...
Read more »

3. Longest Substring Without Repeating Characters

Posted on 2018-11-09 | In 算法 | leetcode
Words count in article: 409 | Reading time ≈ 1
题目 Given a string, find the length of the longest substring without repeating characters. Example 1234Input: "pwwkew"Output: 3Explanation: ...
Read more »

67. Add Binary

Posted on 2018-11-09 | In 算法 | leetcode
Words count in article: 275 | Reading time ≈ 1
题目 Given two binary strings, return their sum (also a binary string). The input strings are both non-empty and contains only characters 1 or 0. exam ...
Read more »

1. Two Sum

Posted on 2018-11-09 | In 算法 | leetcode
Words count in article: 269 | Reading time ≈ 1
题目Given an array of integers, return indices of the two numbers such that they add up to a specific target. You may assume that each input would have ...
Read more »

区块链基础问答

Posted on 2018-11-08 | In 区块链
Words count in article: 1.1k | Reading time ≈ 3
问题1:为什么要有stateRoot?stateRoot是存储整个系统状态的专用Merkle树的根哈希(所有帐户余额,合同存储,合同代码和帐户nonces都在里面)。其方便节点间状态的互相验证,保证在交易的每个区块(每时每刻),所有节点的状态是一致的。 问题2:nonce值有什么用? 区块中 ...
Read more »

服务计算 - 4 持续集成服务 Travis CI

Posted on 2018-11-08 | In 服务计算
Words count in article: 560 | Reading time ≈ 2
什么是持续集成服务 Travis CI 提供的是持续集成服务(Continuous Integration,简称 CI)。它绑定 Github 上面的项目,只要有新的代码,就会自动抓取。然后,提供一个运行环境,执行测试,完成构建,还能部署到服务器。持续集成指的是只要代码有变更,就自动运行构建和测试, ...
Read more »

服务计算 - 3 Golang开发Linux命令行实用程序 - selpg

Posted on 2018-11-08 | In 服务计算
Words count in article: 1.5k | Reading time ≈ 6
1. 介绍 Linux命令行使用程序 - selpg,这个名称代表SELect PaGes。selpg允许用户指定从输入文本抽取的页的范围,这些输入文本可以来自文件或另一个进程。 关于selpg的详细介绍,参照开发Linux命令行实用程序 实现slepg代码 我的 - Golang实现 官方 - C ...
Read more »

服务计算 - 2 Go语言开发环境配置

Posted on 2018-11-08 | In 服务计算
Words count in article: 721 | Reading time ≈ 3
1. 安装一些必要的工具1.1 安装Git客户端 Go 语言的插件主要在 Github 上,安装 git 客户端是首要工作。 sudo yum install git 1.2 安装VSCode编辑器 本条仅对不熟悉使用vim或者emacs的用户 linux下安装 官方教程 - Running ...
Read more »
<i class="fa fa-angle-left"></i>1…567<i class="fa fa-angle-right"></i>

65 posts
14 categories
19 tags
RSS
GitHub
© 2023 liuyt49
Powered by Hexo
|
Theme — NexT.Mist v5.1.4
访问人数 访问总量 次