JAVA算法：最长重复子序列（JAVA）

JAVA算法：最长重复子序列（JAVA）

Longest Repeating Subsequence
Given a string, find length of the longest repeating subseequence such that the two subsequence don’t have same string character at same position, i.e., any i’th character in the two subsequences shouldn’t have the same index in the original string.

---

算法设计

package com.bean.algorithm.basic;

public class LongestRepeatingSubsequence {
	// Function to find the longest repeating subsequence
	static int findLongestRepeatingSubSeq(String str) {
		int n = str.length();

		// Create and initialize DP table
		int[][] dp = new int[n + 1][n + 1];

		// Fill dp table (similar to LCS loops)
		for (