import java.util.*; public class Solution { //时间复杂度O(N) 空间复杂度O(N) public int FirstNotRepeatingChar(String str) { Map<Character,Integer>map = new HashMap<>(); for(int i = 0;i<str.length();i++){ char c = str.charAt(i); if(!map.containsKey(...