remove target

Author: wearewin

antlr/src/main/java/com/salk/lib/antlr/mysql/listener/MySqlParserListenerExample.java

@@ -271,7 +271,7 @@ private void addCondition(ParseTree child, String field, String symbol,
                 value = getOriginStr(childChild.getText());
             }
         }
-        mySqlParserContext.addCondition(field, symbol, value);
+        mySqlParserContext.addCondition(field, logicalOperator==null?"AND":logicalOperator.getText(), value);
     }
 
     private String getOriginStr(String text) {

antlr/src/main/java/com/salk/lib/antlr/mysql/lexer/MySqlLexer.g4 renamed to antlr/src/main/java/com/salk/lib/antlr/mysql/parser/MySqlLexer.g4

@@ -1,5 +1,5 @@
 // Generated from java-escape by ANTLR 4.11.1
-package com.salk.lib.antlr.mysql.lexer;
+package com.salk.lib.antlr.mysql.parser;
 
 import org.antlr.v4.runtime.*;
 import org.antlr.v4.runtime.atn.ATN;

antlr/src/main/java/com/salk/lib/antlr/mysql/lexer/MySqlLexer.interp renamed to antlr/src/main/java/com/salk/lib/antlr/mysql/parser/MySqlLexer.interp

@@ -0,0 +1,11 @@
+package com.salk.lib;
+
+/**
+ * 测试classa
+ *
+ * @author salk
+ * @date 2022/10/23
+ */
+public class TestClassA {
+
+}

antlr/src/main/java/com/salk/lib/antlr/mysql/lexer/MySqlLexer.java renamed to antlr/src/main/java/com/salk/lib/antlr/mysql/parser/MySqlLexer.java

@@ -1,5 +1,8 @@
 package com.salk.lib.offer;
 
+import java.util.ArrayList;
+import java.util.List;
+
 /**
  * @author salkli
  * @since 2022/10/14
@@ -51,36 +54,98 @@ public static void main(String[] args) {
         //String abcdefg = reverseLeftWords("abcdefg", 2);
         int[] inputs = new int[]{2,3,7,8,8,10};
         int target=8;
-        System.out.println(sortedHalfSearch(inputs,target));
-
+        //System.out.println(sortedHalfSearch(inputs,target));
+        inputs = new int[]{3,3,3,1};
+        System.out.println('c'-'a');
+        String s="acdeface";
+        char c = firstUniqChar(s);
+        System.out.println(c);
+        //missingNumber(inputs);
+        //minArray(inputs);
     }
 
     public static int sortedHalfSearch(int[] inputs,  int target) {
-        int i=0;
-        int j=inputs.length-1;
-        while(i<=j) {
-            int m = (j+i) / 2;
+        int i = 0;
+        int j = inputs.length - 1;
+        while (i <= j) {
+            int m = (j + i) / 2;
             int value = inputs[m];
             if (value <= target) {
                 i = m + 1;
-            } else  {
+            } else {
                 j = m - 1;
             }
         }
-        int right=i;
-        i=0;
-        j=inputs.length-1;
-        while(i<=j) {
-            int m = (j+i) / 2;
+        int right = i;
+        i = 0;
+        j = inputs.length - 1;
+        while (i <= j) {
+            int m = (j + i) / 2;
             int value = inputs[m];
             if (value < target) {
                 i = m + 1;
-            } else  {
+            } else {
                 j = m - 1;
             }
         }
-        int left=j;
-        return right-left-1;
+        int left = j;
+        return right - left - 1;
+    }
+
+    public static int missingNumber(int[] nums) {
+        int i=0;
+        int j=nums.length-1;
+        while(i<=j){
+            int m=(i+j)/2;
+            if(nums[m]!=m){
+                j=m-1;
+            }else{
+                i=m+1;
+            }
+        }
+        return nums[j]-1;
+    }
+    public static int minArray(int[] numbers) {
+        int i=0;
+        int j=numbers.length-1;
+        while(i<=j){
+            int m=(i+j)/2;
+            if(numbers[m]>numbers[j]){
+                i=m+1;
+            }else if(numbers[m]<numbers[j]){
+                j=m;
+            }else{
+                j--;
+            }
+        }
+        return numbers[i];
+    }
+
+    public static char firstUniqChar(String s) {
+        int sta = 0;
+        int vis = 0;
+        char[] chars = s.toCharArray();
+        for (char c : chars) {
+            int x = c - 'a';
+            if ((vis & (1 << x)) != 0) {
+                continue;
+            }
+            if ((sta & (1 << x)) != 0) {
+                sta ^= (1 << x);
+                vis |= (1 << x);
+
+            } else {
+                sta |= (1 << x);
+            }
+        }
+            for (char cr : chars) {
+                int x2 = cr - 'a';
+                if ((sta & (1 << x2)) != 0) {
+                    return cr;
+                }
+            }
+            return ' ';
     }
 
+
 }