{ "question_id": 507751, "question_title": "怎么样能在一个字符串里判断是否包含数组里的内容?", "question_content": "例如:\n\nstring a=\"ILOVEU\";\nstring[] F={\"I\",\"L\",\"U\"};\n循环条件?\n if(怎么判断a是否在数组F里)\n {\n 在F里并且提取出来\n }ELSE{不在}\n", "difficulty": "简单", "answer_id": 438340, "answer_content": "\n\n```\n // 判断字符串在数组内\n\tpublic static void stringInArray() {\n\t\tString str = \"HELL\";\n\t\tString[] arr = { \"H\", \"E\", \"L\", \"L\", \"O\" };\n\t\tboolean flag = true;\n\t\tfor (int i = 0; i < str.length() && flag; i++) {\n\t\t\tString item = String.valueOf(str.charAt(i));\n\t\t\tfor (String aa : arr) {\n\t\t\t\tif (aa.equals(item)) {\n\t\t\t\t\tSystem.out.println(item + \"在数组内\");\n\t\t\t\t\tflag = true;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tflag = false;\n\t\t\t}\n\t\t}\n\t\tif (flag) {\n\t\t\tSystem.out.println(\"字符串在数组内。\");\n\t\t} else {\n\t\t\tSystem.out.println(\"字符串不在数组内。\");\n\t\t}\n\t}\n\n\t// 判断数组在字符串内\n\tpublic static void arrayInString() {\n\t\tString str = \"HELLO\";\n\t\tString[] arr = { \"H\", \"E\", \"L\", \"L\", \"O\" };\n\t\tboolean flag = true;\n\t\tfor (String aa : arr) {\n\t\t\tif (!str.contains(aa)) {\n\t\t\t\tSystem.out.println(\"字符串不包含:\" + aa);\n\t\t\t\tflag = false;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif (flag) {\n\t\t\tSystem.out.println(\"数组在字符串内。\");\n\t\t} else {\n\t\t\tSystem.out.println(\"数组不在字符串内。\");\n\t\t}\n\t}\n```\n感觉这是最笨的方法了。\n", "tag_name": "java", "java": "\tpublic static void stringInArray() {\n\t\tString str = \"HELL\";\n\t\tString[] arr = { \"H\", \"E\", \"L\", \"L\", \"O\" };\n\t\tboolean flag = true;\n\t\tfor (int i = 0; i < str.length() && flag; i++) {\n\t\t\tString item = String.valueOf(str.charAt(i));\n\t\t\tfor (String aa : arr) {\n\t\t\t\tif (aa.equals(item)) {\n\t\t\t\t\tSystem.out.println(item + \"在数组内\");\n\t\t\t\t\tflag = true;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tflag = false;\n\t\t\t}\n\t\t}\n\t\tif (flag) {\n\t\t\tSystem.out.println(\"字符串在数组内。\");\n\t\t} else {\n\t\t\tSystem.out.println(\"字符串不在数组内。\");\n\t\t}\n\t}\n\tpublic static void arrayInString() {\n\t\tString str = \"HELLO\";\n\t\tString[] arr = { \"H\", \"E\", \"L\", \"L\", \"O\" };\n\t\tboolean flag = true;\n\t\tfor (String aa : arr) {\n\t\t\tif (!str.contains(aa)) {\n\t\t\t\tSystem.out.println(\"字符串不包含:\" + aa);\n\t\t\t\tflag = false;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif (flag) {\n\t\t\tSystem.out.println(\"数组在字符串内。\");\n\t\t} else {\n\t\t\tSystem.out.println(\"数组不在字符串内。\");\n\t\t}\n\t}", "topic_link": "https://bbs.csdn.net/topics/600470194", "status": 0, "keywords": "算法高阶,字符串匹配,算法问题选编,利用有限自动机进行字符串匹配", "license": "csdn.net", "notebook": { "java": "https://codechina.csdn.net/csdn/csdn-daily-code/-/jupyter/master/data/notebook/answer/ipynb/java/38.ipynb?type=file" } }