<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[whiteParachute的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/whiteParachute</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; whiteParachute]]></copyright><item><title><![CDATA[【Postman】在Tests中获取 headers/body 的信息并填入 environment 中]]></title><link>https://blog.youkuaiyun.com/whiteParachute/article/details/108298415</link><guid>https://blog.youkuaiyun.com/whiteParachute/article/details/108298415</guid><author>whiteParachute</author><pubDate>Sat, 29 Aug 2020 19:30:43 +0800</pubDate><description><![CDATA[Postman在tests中获取headers/body的信息并填入environment中


# 获取headers中的信息
var jsonData = pm.response.headers.get("Connection");
pm.environment.set("Connection", jsonData);


# 获取body中的信息填入environment
var jsonData = pm.response.json();
var token = jsonData.json.toke]]></description><category></category></item><item><title><![CDATA[【Postman】Postman中tests简单语法及使用]]></title><link>https://blog.youkuaiyun.com/whiteParachute/article/details/108297587</link><guid>https://blog.youkuaiyun.com/whiteParachute/article/details/108297587</guid><author>whiteParachute</author><pubDate>Sat, 29 Aug 2020 18:00:52 +0800</pubDate><description><![CDATA[Postman中的Tests工具可以帮助我们写一些非常简单的断言帮助我们测试，如果你不熟悉JavaScript语法的话postman还为用户提供了几种模板来写断言。

以下是几种比较常用的断言


pm.test("响应状态码为200", function () {
    pm.response.to.have.status(200);
});

pm.test("响应数据中包含json_key1", function () {
    pm.expect(pm.response.text()).to..]]></description><category></category></item><item><title><![CDATA[牛客网-剑指offer-重建二叉树]]></title><link>https://blog.youkuaiyun.com/whiteParachute/article/details/80181900</link><guid>https://blog.youkuaiyun.com/whiteParachute/article/details/80181900</guid><author>whiteParachute</author><pubDate>Thu, 03 May 2018 16:20:39 +0800</pubDate><description><![CDATA[运行时间：7ms占用内存：476k/**
 * Definition for binary tree
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };...]]></description><category></category></item><item><title><![CDATA[牛客网-剑指offer-从尾到头打印链表]]></title><link>https://blog.youkuaiyun.com/whiteParachute/article/details/80177336</link><guid>https://blog.youkuaiyun.com/whiteParachute/article/details/80177336</guid><author>whiteParachute</author><pubDate>Thu, 03 May 2018 11:20:37 +0800</pubDate><description><![CDATA[运行时间：3ms占用内存：608k/**
*  struct ListNode {
*        int val;
*        struct ListNode *next;
*        ListNode(int x) :
*              val(x), next(NULL) {
*        }
*  };
*/
class Solution {
public:
...]]></description><category></category></item><item><title><![CDATA[牛客网-剑指offer-替换空格]]></title><link>https://blog.youkuaiyun.com/whiteParachute/article/details/80177064</link><guid>https://blog.youkuaiyun.com/whiteParachute/article/details/80177064</guid><author>whiteParachute</author><pubDate>Thu, 03 May 2018 11:08:43 +0800</pubDate><description><![CDATA[运行时间：6ms占用内存：608kclass Solution {
public:
	void replaceSpace(char *str,int length) {
        for(int i = 0; i &amp;lt; length - 1; i++)
        {
            if(str[i] == ' ')
            {
              ...]]></description><category></category></item><item><title><![CDATA[牛客网-剑指offer-二维数组中的查找]]></title><link>https://blog.youkuaiyun.com/whiteParachute/article/details/80176863</link><guid>https://blog.youkuaiyun.com/whiteParachute/article/details/80176863</guid><author>whiteParachute</author><pubDate>Thu, 03 May 2018 11:00:04 +0800</pubDate><description><![CDATA[运行时间：13ms占用内存：1496kclass Solution {
public:
    bool Find(int target, vector&amp;lt;vector&amp;lt;int&amp;gt; &amp;gt; array) {
        int rows = 0;
        int cols = array[0].size() - 1;
        while(rows &amp;lt; ar...]]></description><category></category></item><item><title><![CDATA[c++ string find() 返回值]]></title><link>https://blog.youkuaiyun.com/whiteParachute/article/details/53258512</link><guid>https://blog.youkuaiyun.com/whiteParachute/article/details/53258512</guid><author>whiteParachute</author><pubDate>Mon, 21 Nov 2016 13:14:16 +0800</pubDate><description><![CDATA[网上找了半天也没找到谁写的彻底一点，还不如自己动手。#include 

using namespace std;

int main()
{
    string s;
    while(cin >> s)
    {
        int f = s.find("o");
        cout << f << endl;
    }
    return 0;
}

结论：
找到就]]></description><category></category></item><item><title><![CDATA[hdu 2035]]></title><link>https://blog.youkuaiyun.com/whiteParachute/article/details/49779539</link><guid>https://blog.youkuaiyun.com/whiteParachute/article/details/49779539</guid><author>whiteParachute</author><pubDate>Wed, 11 Nov 2015 11:25:39 +0800</pubDate><description><![CDATA[http://acm.hdu.edu.cn/showproblem.php?pid=2035#include <iostream>using namespace std;int _pow(int a, int b)
{
    long long sum(1);
    a %= 1000;
    while(b > 1)
    {
        if(b % 2 == 1) sum = (s]]></description><category></category></item><item><title><![CDATA[hdu 2022]]></title><link>https://blog.youkuaiyun.com/whiteParachute/article/details/49500017</link><guid>https://blog.youkuaiyun.com/whiteParachute/article/details/49500017</guid><author>whiteParachute</author><pubDate>Fri, 30 Oct 2015 00:06:12 +0800</pubDate><description><![CDATA[海选女主角Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) 
Total Submission(s): 43474    Accepted Submission(s): 19378Problem Description 
potato老师虽然很喜欢教书，但是迫于生活压力，不得不想办法]]></description><category></category></item><item><title><![CDATA[hdu 2011]]></title><link>https://blog.youkuaiyun.com/whiteParachute/article/details/49155595</link><guid>https://blog.youkuaiyun.com/whiteParachute/article/details/49155595</guid><author>whiteParachute</author><pubDate>Thu, 15 Oct 2015 17:37:23 +0800</pubDate><description><![CDATA[多项式求和Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) 
Total Submission(s): 54704    Accepted Submission(s): 31792Problem Description 
多项式的描述如下： 
1 - 1/2 + 1/3 - 1/4]]></description><category></category></item><item><title><![CDATA[cf 325-B]]></title><link>https://blog.youkuaiyun.com/whiteParachute/article/details/49102277</link><guid>https://blog.youkuaiyun.com/whiteParachute/article/details/49102277</guid><author>whiteParachute</author><pubDate>Tue, 13 Oct 2015 18:24:43 +0800</pubDate><description><![CDATA[B. Laurenty and Shop
time limit per test：1 second 
memory limit per test：256 megabytes 
input：standard input 
output：standard output 
A little boy Laurenty has been playing his favourite game Nota for]]></description><category></category></item><item><title><![CDATA[cf 325 A]]></title><link>https://blog.youkuaiyun.com/whiteParachute/article/details/49101921</link><guid>https://blog.youkuaiyun.com/whiteParachute/article/details/49101921</guid><author>whiteParachute</author><pubDate>Tue, 13 Oct 2015 17:49:57 +0800</pubDate><description><![CDATA[A. Alena’s Schedule 
time limit per test1 second 
memory limit per test256 megabytes 
inputstandard input 
outputstandard output 
Alena has successfully passed the entrance exams to the university and]]></description><category></category></item><item><title><![CDATA[hdu 2010]]></title><link>https://blog.youkuaiyun.com/whiteParachute/article/details/49101717</link><guid>https://blog.youkuaiyun.com/whiteParachute/article/details/49101717</guid><author>whiteParachute</author><pubDate>Tue, 13 Oct 2015 17:37:14 +0800</pubDate><description><![CDATA[水仙花数Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) 
Total Submission(s): 130677    Accepted Submission(s): 38395Problem Description 
春天是鲜花的季节，水仙花就是其中最迷人的代表，数学上有个水仙花]]></description><category></category></item><item><title><![CDATA[hdu 2009]]></title><link>https://blog.youkuaiyun.com/whiteParachute/article/details/49101335</link><guid>https://blog.youkuaiyun.com/whiteParachute/article/details/49101335</guid><author>whiteParachute</author><pubDate>Tue, 13 Oct 2015 17:18:45 +0800</pubDate><description><![CDATA[求数列的和Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) 
Total Submission(s): 58441    Accepted Submission(s): 35873Problem Description 
数列的定义如下： 
数列的第一项为n，以后各项为前一项的平方根]]></description><category></category></item><item><title><![CDATA[hdu 2008]]></title><link>https://blog.youkuaiyun.com/whiteParachute/article/details/49101103</link><guid>https://blog.youkuaiyun.com/whiteParachute/article/details/49101103</guid><author>whiteParachute</author><pubDate>Tue, 13 Oct 2015 17:05:33 +0800</pubDate><description><![CDATA[数值统计Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) 
Total Submission(s): 73753    Accepted Submission(s): 36832Problem Description 
统计给定的n个数中，负数、零和正数的个数。Input 
输入数据]]></description><category></category></item></channel></rss>