Given a string, find the first non-repeating character in it and return it's index. If it doesn't exist, return -1. Examples: s = "leetcode" return 0. s = "loveleetcode", return 2. Note: You may assume the string contain only lowercase…
1.3 Given two strings, write a method to decide if one is a permutation of the other. 这道题给定我们两个字符串,让我们判断一个是否为另一个的全排列字符串.在LeetCode中,关于排列的题有如下几道,Permutation Sequence 序列排序,Permutations 全排列, Permutations II 全排列之二 和 Next Permutation 下一个排列.这道题跟它们比起来,算是很简单的…