X

Home Archives
2018-07-22

c++

  1. split
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
static void _split(const string &s, char delim,
vector<string> &elems) {
stringstream ss(s);
string item;

while (getline(ss, item, delim)) {
elems.push_back(item);
}
}

vector<string> split(const string &s, char delim) {
vector<string> elems;
_split(s, delim, elems);
return elems;
}
Share
Newer
leetcode-856
Older
sql

Tags

  • Dynamic Programming
  • LeetCode
  • binary-tree
  • bit
  • 剑指Offer
  • 程序员面试金典

Tag Cloud

Dynamic Programming LeetCode binary-tree bit 剑指Offer 程序员面试金典

Archives

  • July 2020
  • June 2020
  • May 2020
  • April 2020
  • March 2020
  • February 2020
  • January 2020
  • December 2019
  • November 2019
  • October 2019
  • September 2019
  • August 2019
  • July 2019
  • June 2019
  • May 2019
  • April 2019
  • March 2019
  • February 2019
  • January 2019
  • December 2018
  • October 2018
  • September 2018
  • August 2018
  • July 2018
  • June 2018
  • May 2018

Recent Posts

  • java-hashmap
  • wellknown-ports
  • code4offer-23
  • code4offer-13 机器人的运动范围
  • code4offer-51 数组中的逆序对
© 2020 ARCSINW
Powered by Hexo
Home Archives