【leetcode】917. Reverse Only Letters（双指针）

【【leetcode】917. Reverse Only Letters（双指针）】的更多相关文章

[LeetCode] 917. Reverse Only Letters 只翻转字母

Given a string S, return the "reversed" string where all characters that are not a letter stay in the same place, and all letters reverse their positions. Example 1: Input: "ab-cd" Output: "dc-ba" Example 2: Input: "a-bC…

#Leetcode# 917. Reverse Only Letters

https://leetcode.com/problems/reverse-only-letters/ Given a string S, return the "reversed" string where all characters that are not a letter stay in the same place, and all letters reverse their positions. Example 1: Input: "ab-cd"…

LeetCode 917 Reverse Only Letters 解题报告

题目要求 Given a string S, return the "reversed" string where all characters that are not a letter stay in the same place, and all letters reverse their positions. 题目分析及思路给定一个字符串,返回“reversed”后的字符串,要求非字母的字符保留原来的位置,字母字符逆序排列.可以先获得原字符串中的全部字母字符列表,然后遍历原字…

LeetCode 917. Reverse Only Letters (仅仅反转字母)

题目标签:String 利用left, right 两个pointers, 从左右开始互换字母.如果遇到的不是字母,那么继续移动到下一个. Java Solution: Runtime beats 29.87% 完成日期:12/08/2018 关键点:two pointers class Solution { public String reverseOnlyLetters(String S) { char[] charArr = S.toCharArray(); int left = 0;…

【Leetcode_easy】917. Reverse Only Letters

problem 917. Reverse Only Letters solution: class Solution { public: string reverseOnlyLetters(string S) { , j=S.size()-; i<j; )//err... { if(!isalpha(S[i])) i++; else if(!isalpha(S[j])) j--; else { char tmp = S[i]; S[i] = S[j]; S[j] = tmp; i++; j--;…