Advertisement
Guest User

Untitled

a guest
Apr 8th, 2019
122
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 2.22 KB | None | 0 0
  1. package mysql_interface;
  2.  
  3. import java.sql.*;
  4.  
  5. public class DatabaseManager implements DatabaseManagerIntf{
  6.  
  7. private static String CONNECTION_URL = "jdbc:mysql://db01.healthcreek.org:3306/capstone";
  8.  
  9. private static DatabaseManager instance;
  10. public Connection mConnection;
  11.  
  12. public String mUserName;
  13. public String mPassword;
  14.  
  15. private DatabaseManager() {
  16. }
  17.  
  18. public static DatabaseManagerIntf getInstance() {
  19. if( instance == null ) {
  20. instance = new DatabaseManager();
  21. }
  22.  
  23. return instance;
  24. }
  25.  
  26. public void setCredentials( String aUserName, String aPassword ) {
  27. mUserName = aUserName;
  28. mPassword = aPassword;
  29. }
  30.  
  31. @Override
  32. public void openConnection() {
  33.  
  34. try {
  35. if( mConnection != null && !mConnection.isClosed() ) {
  36. return;
  37. }
  38.  
  39. mConnection = DriverManager.getConnection(CONNECTION_URL, mUserName, mPassword);
  40. } catch (Exception e) {
  41. e.printStackTrace();
  42. } finally {
  43.  
  44. }
  45. }
  46.  
  47. @Override
  48. public void closeConnection() {
  49. try {
  50. mConnection.close();
  51. } catch (Exception e) {
  52. e.printStackTrace();
  53. } finally {
  54.  
  55. }
  56. }
  57.  
  58. @Override
  59. public void pushSqlQuery( String aQuery ) {
  60. try {
  61. Statement statement = mConnection.createStatement();
  62. //statement.executeQuery( aQuery );
  63. statement.close();
  64. } catch (Exception e) {
  65. e.printStackTrace();
  66. } finally {
  67.  
  68. }
  69. }
  70.  
  71. public static void main(String[] args) throws Exception {
  72. String inputString = "GUACCGGUAGUAC";
  73. // String inputString = "ACCGGUAGU";
  74. int n = inputString.length();
  75.  
  76. int[][] dp = new int[n+1][n+1];
  77.  
  78. for( int k = 5; k <= n - 1; k++ ) {
  79. for( int i = 1 ; i <= n - k; i++) {
  80. int j = i + k;
  81.  
  82. dp[i][j] = dp[i][j-1];
  83. for( int t = i; t <= j - 4 ; t++ ) {
  84. if (isMatch(inputString.charAt(t - 1), inputString.charAt(j - 1))) {
  85. dp[i][j] = Math.max( dp[i][j], 1 + dp[i][t-1] + dp[t+1][j-1] );
  86. }
  87. }
  88. }
  89. }
  90.  
  91. for( int i = n - 5; i >= 1; i--) {
  92. for( int j = 6; j <= n ; j++) {
  93. System.out.print( dp[i][j] + " " );
  94. }
  95. System.out.println();
  96. }
  97. }
  98.  
  99. public static boolean isMatch( char a, char b ) {
  100. return ( a == 'G' && b == 'C') || ( a == 'C' && b == 'G') || ( a == 'A' && b == 'U') || ( a == 'U' && b == 'A');
  101. }
  102. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement