add code

Author: binbin.hou

src/main/java/com//houbb/leetcode/F1300T1400/T_1371_findTheLongestSubstring_V1.java

@@ -0,0 +1,115 @@
+package com..houbb.leetcode.F1300T1400;
+
+import java.util.HashMap;
+import java.util.Map;
+
+/**
+* @author binbin.hou
+* @since 1.0.0
+*/
+@Deprecated
+public class T_1371_findTheLongestSubstring_V1 {
+
+
+/**
+* 构建对应的数组
+*
+* 子数组：所以使用前缀和来解决？
+* @param s
+* @return
+*/
+public int findTheLongestSubstring(String s) {
+// 如果是拆分为5个数组呢？
+final int len = s.length();
+char[] chars = s.toCharArray();
+
+int[] aSum = initPrefixSum(chars, 'a');
+int[] eSum = initPrefixSum(chars, 'e');
+int[] iSum = initPrefixSum(chars, 'i');
+int[] oSum = initPrefixSum(chars, 'o');
+int[] uSum = initPrefixSum(chars, 'u');
+
+// 找到最长的为0的数组
+Map<Integer, Integer> countMapA = new HashMap<>();
+Map<Integer, Integer> countMapE = new HashMap<>();
+Map<Integer, Integer> countMapI = new HashMap<>();
+Map<Integer, Integer> countMapO = new HashMap<>();
+Map<Integer, Integer> countMapU = new HashMap<>();
+// 兼容从零开始的情况
+countMapA.put(0, -1);
+countMapE.put(0, -1);
+countMapI.put(0, -1);
+countMapO.put(0, -1);
+countMapU.put(0, -1);
+
+int maxLen = 0;
+
+for(int i = 0; i < len; i++) {
+int sumA = aSum[i];
+int sumE = eSum[i];
+int sumI = iSum[i];
+int sumO = oSum[i];
+int sumU = uSum[i];
+
+
+if(countMapA.containsKey(sumA)) {
+int startIxA = countMapA.get(sumA);
+} else {
+countMapA.put(sumA, i);
+}
+
+if(countMapE.containsKey(sumE)) {
+int startIxE = countMapE.get(sumE);
+} else {
+countMapE.put(sumE, i);
+}
+
+if(countMapI.containsKey(sumI)) {
+int startIxI = countMapI.get(sumI);
+} else {
+countMapI.put(sumI, i);
+}
+
+if(countMapO.containsKey(sumO)) {
+int startIxO = countMapI.get(sumO);
+} else {
+countMapI.put(sumI, i);
+}
+}
+
+return maxLen;
+}
+
+private int[] initPrefixSum(char[] chars,
+char targetChar) {
+final int n = chars.length;
+int[] prefixSum = new int[n];
+Map<Character, Integer> charCount = new HashMap<>();
+prefixSum[0] = getCharVal(chars[0], targetChar, charCount);
+for(int i = 1; i < n; i++) {
+prefixSum[i] = prefixSum[i-1] + getCharVal(chars[i], targetChar, charCount);
+}
+return prefixSum;
+}
+
+private int getCharVal(char c,
+char targetChar,
+Map<Character, Integer> charCount) {
+int count = charCount.getOrDefault(c, 0);
+count++;
+charCount.put(c, count);
+
+if(c != targetChar) {
+return 0;
+}
+
+// 让元音字母成对出现
+if(count % 2 == 0) {
+return 1;
+}
+return -1;
+}
+
+
+
+}

src/main/java/com//houbb/leetcode/F1300T1400/T_1371_findTheLongestSubstring_V2.java

@@ -0,0 +1,65 @@
+package com..houbb.leetcode.F1300T1400;
+
+import java.util.Arrays;
+import java.util.HashMap;
+import java.util.Map;
+
+/**
+* @author binbin.hou
+* @since 1.0.0
+*/
+public class T_1371_findTheLongestSubstring_V2 {
+
+
+private void toggleState(int[] states, int index) {
+states[index] = states[index] == 1 ? 0 : 1;
+}
+
+/**
+* 构建对应的数组
+*
+* 子数组：所以使用前缀和来解决？
+* @param s
+* @return
+*/
+public int findTheLongestSubstring(String s) {
+// 如果是拆分为5个数组呢？
+final int len = s.length();
+char[] chars = s.toCharArray();
+
+// 状态数组
+int[] states = new int[5];
+Map<String, Integer> map = new HashMap<>();
+
+// 初始化
+
+int maxLen = 0;
+for(int i = 0; i < len; i++) {
+char c = chars[i];
+
+if(c == 'a') {
+toggleState(states, 0);
+}else if(c == 'e') {
+toggleState(states, 1);
+}else if(c == 'i') {
+toggleState(states, 2);
+}else if(c == 'o') {
+toggleState(states, 3);
+}else if(c == 'u') {
+toggleState(states, 4);
+}
+
+// 如果已经有 说明差值相同
+String stateString = Arrays.toString(states);
+if(map.containsKey(stateString)) {
+maxLen = Math.max(maxLen, i - map.get(stateString));
+}
+
+// 记录状态
+map.put(stateString, i);
+}
+
+return maxLen;
+}
+
+}

src/main/java/com//houbb/leetcode/F1300T1400/T_1371_findTheLongestSubstring_V3.java

@@ -0,0 +1,74 @@
+package com..houbb.leetcode.F1300T1400;
+
+import java.util.Arrays;
+import java.util.HashMap;
+import java.util.Map;
+
+/**
+* @author binbin.hou
+* @since 1.0.0
+*/
+public class T_1371_findTheLongestSubstring_V3 {
+
+
+private void toggleState(int[] states, int index) {
+states[index] = states[index] == 1 ? 0 : 1;
+}
+
+// 位运算也行
+private int calcValue(int[] states) {
+int sum = 0;
+for(int i = 0; i < states.length; i++) {
+sum += states[i] * 10;
+}
+return sum;
+}
+
+/**
+* 构建对应的数组
+*
+* 子数组：所以使用前缀和来解决？
+* @param s
+* @return
+*/
+public int findTheLongestSubstring(String s) {
+// 如果是拆分为5个数组呢？
+final int len = s.length();
+char[] chars = s.toCharArray();
+
+// 状态数组
+int[] states = new int[5];
+Map<Integer, Integer> map = new HashMap<>();
+
+// 初始化
+
+int maxLen = 0;
+for(int i = 0; i < len; i++) {
+char c = chars[i];
+
+if(c == 'a') {
+toggleState(states, 0);
+}else if(c == 'e') {
+toggleState(states, 1);
+}else if(c == 'i') {
+toggleState(states, 2);
+}else if(c == 'o') {
+toggleState(states, 3);
+}else if(c == 'u') {
+toggleState(states, 4);
+}
+
+// 如果已经有 说明差值相同
+int val = calcValue(states);
+if(map.containsKey(val)) {
+maxLen = Math.max(maxLen, i - map.get(val));
+}
+
+// 记录状态
+map.put(val, i);
+}
+
+return maxLen;
+}
+
+}