709. To Lower Case # 题目 # Given a string s, return the string after replacing every uppercase letter with the same lowercase letter. Example 1: Input: s = "Hello" Output: "hello" Example 2: Input: s = "here" Output: "here" Example 3: Input: s = "LOVE
*@param{string}str*@return{string} */vartoLowerCase =function(str) {returnstr.split('').map(i=>String.fromCharCode(i.charCodeAt()|32) ).join('') }; ↑↑↑看不懂的 JavaScript 解法。↑↑↑ classSolution:deftoLowerCase(self,str:str) ->str: trans =str.maketrans('ABCDEFGHIJKLMNOPQRSTU...
[LeetCode]709. To Lower Case Implement function ToLowerCase() that has a string parameter str, and returns the same string in lowercase. 将字符串的大写字母转成小写字母字符串。 Example 1: Example 2: Example 3: 思路: ASCII码中大写字母比小写字母小32,直接加上32变成小写字母。......
题目地址:https://leetcode.com/problems/to-lower-case/description/ 题目描述: Implement function ToLowerCase() that has a string parameter str, and returns the same string in lowercase. 题目大意 把字符串的大写字母全都转化成小写。 解题方法 ASIIC码操作 当然可以直接使用lower()函数,直接能过。但是,...
To Lower Case(转换成小写字母) * 实现函数 ToLowerCase(),该函数接收一个字符串参数 str,并将该字符串中的大写字母转换成小写字母,之后返回新的字符串。 */ public class Solution709 { public static void main(String[] args) { Solution709 solution709 = new Solution709(); String str = "Hello"; ...
class Solution: def toLowerCase(self, str: str) -> str: t='' for ch in str: if(ch>='A' and ch<='Z'): t+=chr(ord(ch)+32) else: t+=ch return t 1. 2. 3. 4. 5. 6. 7. 8. 9. 参考文献 [LeetCode] Python short 1 line ASCII & string method solutions...
解法:其实就是模拟String中的toLowerCase方法;这里需要注意的时所给字符串中的字符可能包含非字母,所以需要判断是否为大写字母,再进行转换; Java class Solution { public String toLowerCase(String str) { char[] result = new char[str.length()]; ...
solution class Solution { public String toLowerCase(String str) { StringBuilder s = new StringBuilder(); for (int i=0; i<str.length(); i++) { if ('a' <= str.charAt(i) && str.charAt(i) <='z') s.append(str.charAt(i)); else if ('A' <= str.charAt(i) && str.charAt(i...
—Easy https://leetcode.com/problems/to-lower-case/ Code: 思路: 1.复习一下Python的string操作... 查看原文 leetcode813+区间DP https://leetcode.com/problems/largest-sum-of-averages/ leetcode763+贪心。map记录每个字符最右边的位置 https://leetcode.com/problems/partition-labels/ ...
LeetCode 709 To Lower Case 解法 根据ASCII码判断并返回即可,大写 A - Z 为 065 - 090,小写 a - z 为 097 - 122,正好相隔 32,当为大写时,将 ASCII 码 + 32 即可。 代码语言:javascript 代码 classSolution{publicStringtoLowerCase(String str){char[]chars=str.toCharArray();for(int i=0;i<...