![](https://img-blog.csdnimg.cn/20201014180756927.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
leetcode
JingweiZhu1990
这个作者很懒,什么都没留下…
展开
-
反转单词顺序
//使用反转字符串方法,来实现单词顺序反转。 //基本原理:首先我们把待反转字符串(一段话)整体反转, //比如说“I am a student”反转为”tneduts a ma I”, //然后再逐个单词反转,最后得到“student a am I”。 #include #include using namespace std; class Solution { public原创 2014-04-14 20:11:37 · 689 阅读 · 0 评论 -
Longest Substring Without Repeating Characters
Longest Substring Without Repeating Characters Given a string, find the length of the longest substring without repeating characters. For example, the longest substring without repeating letters fo原创 2014-05-18 17:07:36 · 386 阅读 · 0 评论 -
Regular Expression Matching
Implement regular expression matching with support for '.' and '*'. '.' Matches any single character. '*' Matches zero or more of the preceding element. The matching should cover the entire input st原创 2014-05-20 08:51:00 · 441 阅读 · 0 评论