Java -- idiom chain -- recursive algorithm -- spring JDBC + c3p0

TOTAL 2020-11-08 16:58:51
java idiom chain recursive algorithm

This example , I practice SpringJdbc+c3p0 When I wrote . Input an idiom , Get an incomplete elderberry . Because I have... In my database 3W Many idioms , In the case of excluding the repetition of the samurai idiom , Still can't get all the results , I don't think recursion goes into an endless loop , because My recursion has an end condition , When a given idiom , There's no more solitaire , Just go back to . Take a look at the code .
This example , Let me know that sometimes , With the code to solve the problem, baidu may have no specific way to try . And then I meet c3p0 When you don't find the right driver , It started with Baidu , It hasn't been solved for a long time , I just follow the code , Find out Again driverManger That's to pass String Of url, But my message is empty ,c3p0 It's also written in the configuration file of , It's all right ,c3p0 Profile name for I copied it on the Internet , Looks like the name of the request , But when I changed the name of the configuration file , I can print a connection . This problem has been solved .
after , When I write to find idioms recursively , I've got another question , When I recurs from the root node to the tail node , That is to say, after finding a chain of idioms , I started thinking , How to go back to the next node of the root node , When I do Loop() In the use return Loop() When , You can only get one record . Later, after my rethinking , I just wanted to , When you finish a solitaire , I've copied this solitaire , And remove the value at the end , I don't know how to express it here , I'll stick the code and say .
private List<List<String>>Loop(String word,List<String>listOne,List<List<String>>bigList,int m ){
listOne=new ArrayList<String>();
bigList=new ArrayList<>();
return bigList;
Object []args=new Object[1];
return bigList;
for (int i=0;i<words.size();i++) {
ChengYu cy = words.get(i);
Boolean flag=false;
for (List<String> ll:bigList){
if (listOne != null && !listOne.contains(cy.getWord())&&!flag)
{ listOne.add(cy.getWord());}
// Because there are so many situations , So when it exceeds 3 Just go back to
return bigList;
Loop(cy.getWord(), listOne, bigList,m++);
ArrayList copy2 =new ArrayList<String>();
return bigList;
Every listOne For a solitaire ,bigList Represents the Solitaire you've got .words It means that there are many idioms under the current idiom , If this words Is empty or null On behalf of listOne It's a complete solitaire , This is the time , Just put listOne Add to bigList, After that return Code return after , Just walk to ArrayList copy2 =new ArrayList<String>(); This sentence , This recursion does not recursion once, it packs the variables in the function and puts them on the stack as a whole ,return Just take one from the stack LooP, therefore , After finishing another idiom , I can get the second idiom from the penultimate Jielong group B, I need idioms from B Continue to recursive , At this time, I need to create a new idiom company , And put B The previous idiom node is added in advance , And then there was the following
ArrayList copy2 =new ArrayList<String>();
Because you get B after , And from B Start recursion , I do this by putting B Previous lujing Keep it .
That's what I mean
If a The tag is the idiom group following the root node , Then under the root node there is a1 and a3 Two idioms can connect a dragon .
Empathy a1 Yes b1,b2 Two idioms can connect a dragon ,b1 Yes c1,c2...
When listOne(a1,b1,c1) after ,Loop Out of the stack , This is the time to execute
You can get listOne(a1,b1),for The cycle is to stay and then c This group level loops ,for Loop to the beginning , This is the time
It becomes listOne(a1,b1,c2); If you go on, there will be no child nodes ,Loop Out of the stack ,listOne(a1,b1),, This is the time for stay b layer ,Loop(b1) It's over , Keep going out of the stack , Just keep copying ,listOne It becomes listOne(a1),for b Back to where the loop started ,listOne(a1,b2) , Begin Loop(b2),b2 The following idiom groups are d3,for loop d3 On that floor ,listOne(a1,b2,d3),Loop(d3) because d3 No successor nodes ,Loop(d3) Out of the stack ,listOne(a1,b2), here Loop(b2) All call stacks belong to end , Loop(b2) Out of the stack ,listOne(a1), This is the time Loop(a1) End of call stack for ,Loop(a1) Out of the stack ,listOne(),for The cycle stops at a layer ,list(a3),Loop(a3),list(a3,q3),Loop(q3),list(a3,q3,m4),Loop(m4),list(a3,q3,m4,e5),Loop(e5),words Collection is empty Loop(e5) Out of the stack ,listOne(a3,q3,m4).........
Finally back to Loop(a3) Out of the stack ,listOne();
The call stack is empty ,return bigList ; At this point, the whole process is completed .
I also expressed recursion for the first time The call stack , It's definitely not clear , If you want to know about recursion, you can search the function call stack on the Internet, and you may understand it .


The code and sql Script json File download

Extraction code :801w


  1. 【计算机网络 12(1),尚学堂马士兵Java视频教程
  2. 【程序猿历程,史上最全的Java面试题集锦在这里
  3. 【程序猿历程(1),Javaweb视频教程百度云
  4. Notes on MySQL 45 lectures (1-7)
  5. [computer network 12 (1), Shang Xuetang Ma soldier java video tutorial
  6. The most complete collection of Java interview questions in history is here
  7. [process of program ape (1), JavaWeb video tutorial, baidu cloud
  8. Notes on MySQL 45 lectures (1-7)
  9. 精进 Spring Boot 03:Spring Boot 的配置文件和配置管理,以及用三种方式读取配置文件
  10. Refined spring boot 03: spring boot configuration files and configuration management, and reading configuration files in three ways
  11. 精进 Spring Boot 03:Spring Boot 的配置文件和配置管理,以及用三种方式读取配置文件
  12. Refined spring boot 03: spring boot configuration files and configuration management, and reading configuration files in three ways
  13. 【递归,Java传智播客笔记
  14. [recursion, Java intelligence podcast notes
  15. [adhere to painting for 386 days] the beginning of spring of 24 solar terms
  16. K8S系列第八篇(Service、EndPoints以及高可用kubeadm部署)
  17. K8s Series Part 8 (service, endpoints and high availability kubeadm deployment)
  18. 【重识 HTML (3),350道Java面试真题分享
  19. 【重识 HTML (2),Java并发编程必会的多线程你竟然还不会
  20. 【重识 HTML (1),二本Java小菜鸟4面字节跳动被秒成渣渣
  21. [re recognize HTML (3) and share 350 real Java interview questions
  22. [re recognize HTML (2). Multithreading is a must for Java Concurrent Programming. How dare you not
  23. [re recognize HTML (1), two Java rookies' 4-sided bytes beat and become slag in seconds
  24. 造轮子系列之RPC 1:如何从零开始开发RPC框架
  25. RPC 1: how to develop RPC framework from scratch
  26. 造轮子系列之RPC 1:如何从零开始开发RPC框架
  27. RPC 1: how to develop RPC framework from scratch
  28. 一次性捋清楚吧,对乱糟糟的,Spring事务扩展机制
  29. 一文彻底弄懂如何选择抽象类还是接口,连续四年百度Java岗必问面试题
  30. Redis常用命令
  31. 一双拖鞋引发的血案,狂神说Java系列笔记
  32. 一、mysql基础安装
  33. 一位程序员的独白:尽管我一生坎坷,Java框架面试基础
  34. Clear it all at once. For the messy, spring transaction extension mechanism
  35. A thorough understanding of how to choose abstract classes or interfaces, baidu Java post must ask interview questions for four consecutive years
  36. Redis common commands
  37. A pair of slippers triggered the murder, crazy God said java series notes
  38. 1、 MySQL basic installation
  39. Monologue of a programmer: despite my ups and downs in my life, Java framework is the foundation of interview
  40. 【大厂面试】三面三问Spring循环依赖,请一定要把这篇看完(建议收藏)
  41. 一线互联网企业中,springboot入门项目
  42. 一篇文带你入门SSM框架Spring开发,帮你快速拿Offer
  43. 【面试资料】Java全集、微服务、大数据、数据结构与算法、机器学习知识最全总结,283页pdf
  44. 【leetcode刷题】24.数组中重复的数字——Java版
  45. 【leetcode刷题】23.对称二叉树——Java版
  46. 【leetcode刷题】22.二叉树的中序遍历——Java版
  47. 【leetcode刷题】21.三数之和——Java版
  48. 【leetcode刷题】20.最长回文子串——Java版
  49. 【leetcode刷题】19.回文链表——Java版
  50. 【leetcode刷题】18.反转链表——Java版
  51. 【leetcode刷题】17.相交链表——Java&python版
  52. 【leetcode刷题】16.环形链表——Java版
  53. 【leetcode刷题】15.汉明距离——Java版
  54. 【leetcode刷题】14.找到所有数组中消失的数字——Java版
  55. 【leetcode刷题】13.比特位计数——Java版
  56. oracle控制用户权限命令
  57. 三年Java开发,继阿里,鲁班二期Java架构师
  58. Oracle必须要启动的服务
  59. 万字长文!深入剖析HashMap,Java基础笔试题大全带答案
  60. 一问Kafka就心慌?我却凭着这份,图灵学院vip课程百度云