<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[cosgns的专栏]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/cosgns</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; cosgns]]></copyright><item><title><![CDATA[欢迎使用优快云-markdown编辑器]]></title><link>https://blog.youkuaiyun.com/cosgns/article/details/69524723</link><guid>https://blog.youkuaiyun.com/cosgns/article/details/69524723</guid><author>cosgns</author><pubDate>Fri, 07 Apr 2017 11:00:17 +0800</pubDate><description><![CDATA[leetcode | 324. Wiggle Sort II一、问题描述 
链接：https://leetcode.com/problems/wiggle-sort-ii/#/descriptionGiven an unsorted array nums, reorder it such that nums[0] < nums[1] > nums[2] < nums[3]….Example: 
(1]]></description><category></category></item><item><title><![CDATA[leetcode | 1. Two sum 解题报告]]></title><link>https://blog.youkuaiyun.com/cosgns/article/details/69371848</link><guid>https://blog.youkuaiyun.com/cosgns/article/details/69371848</guid><author>cosgns</author><pubDate>Thu, 06 Apr 2017 09:00:48 +0800</pubDate><description><![CDATA[一、题目


题目链接：https://leetcode.com/problems/two-sum/#/description


Given an array of integers, return indices of the two numbers such that they add up to a specific target.

You may assume that]]></description><category></category></item><item><title><![CDATA[几个C++文件输入常用函数（1）]]></title><link>https://blog.youkuaiyun.com/cosgns/article/details/42012505</link><guid>https://blog.youkuaiyun.com/cosgns/article/details/42012505</guid><author>cosgns</author><pubDate>Thu, 18 Dec 2014 21:38:23 +0800</pubDate><description><![CDATA[最近在做C++的大作业中的小作业，用到文件的地方很多。我也不是第一次用了，但是很久不用就是这么不熟悉，时常会忘记很多细节。今天就在这里总结一下。
1.文件的输入
ifstream fp_account("input.txt");
    if(!fp_account)
//若打开失败
     {
        cout
return 0;
}
int i=0;
string]]></description><category></category></item></channel></rss>