用java解leetcode上easy题5
来源:互联网 发布:淘宝真正的外贸店 编辑:程序博客网 时间:2024/06/04 01:06
344. Reverse String
反转字符串,别人的简单代码:
public class Solution { public String reverseString(String s) { return new StringBuilder(s).reverse().toString(); }}
而我的蠢代码:
import java.util.Collections;//java.lang包是自动导入的,不需要手动import java.util.Arrays;public class Solution { public String reverseString(String s) { char[] str = s.toCharArray(); Character[] str2 = new Character[str.length]; for(int i =0;i<str.length;i++){ str2[i] = str[i]; } Collections.reverse(Arrays.asList(str2)); StringBuffer buff = new StringBuffer(); for(int j =0; j<str2.length; j++){ buff.append(str2[j]); } return buff.toString(); }}
0 0
- 用java解leetcode上easy题5
- 用java解leetcode上easy题3
- 用java解leetcode上easy题4
- 用java解leetcode上的easy题(开始探险)
- 用java解 leetcode上easy题2(开始探险)
- Leetcode--easy系列5
- LeetCode-Easy-Java-Palindrome Number
- LeetCode-Easy-Java-Implement strStr()
- leetcode easy题page1小结
- 【Leetcode】202-Happy Number【Java实现】【Easy】
- Leetcode 1. Two Sum (Easy) (java)
- Leetcode 27. Remove Element (Easy) (java)
- Leetcode 396. Rotate Function (Easy) (java)
- 【leetcode】Array——easy(java)
- LeetCode-Easy-Java-Longest Common Prefix
- LeetCode-Easy-Java-Non-decreasing Array
- LeetCode-Easy-Java-Longest Continuous Increasing Subsequence
- LeetCode-Easy-Java-Maximum Average Subarray I
- Fragment使用心得
- C++与Java中类访问权限的差异
- linux中安装oracle11g
- Servlet学习(三)Servlet编程实例-网站登录(修改版-增加数据库-附源码)
- 求a和b 的和
- 用java解leetcode上easy题5
- Codeforces 453A Little Pony and Expected Maximum
- 怎样在一台机器的listener.ora中配置多个listener
- (GeekBand或极客班)对象的生命周期小实验。
- cf#204-div1 -D - Jeff and Removing Periods-莫队算法-维护等差数列
- java中volatile关键字的含义
- 【平衡树】Treap
- 【知识积累】使用Navicat连接Oracle数据库遇到的问题
- 手机性能标准分类表