JingweiZhu

//使用反转字符串方法，来实现单词顺序反转。//基本原理：首先我们把待反转字符串（一段话）整体反转，//比如说“I am a student”反转为”tneduts a ma I”,//然后再逐个单词反转，最后得到“student a am I”。#include #include using namespace std;class Solution {public

Longest Substring Without Repeating CharactersGiven a string, find the length of the longest substring without repeating characters. For example, the longest substring without repeating letters fo

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