forked from TheRenegadeCoder/sample-programs-website
-
Notifications
You must be signed in to change notification settings - Fork 0
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Generated Sample Programs website automatically
on-behalf-of: @TheRenegadeCoder <[email protected]>
- Loading branch information
1 parent
7d1f4e2
commit d00a699
Showing
5 changed files
with
189 additions
and
4 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,183 @@ | ||
| --- | ||
| authors: | ||
| - rzuckerm | ||
| date: 2024-02-11 | ||
| featured-image: longest-common-subsequence-in-every-language.jpg | ||
| last-modified: 2024-02-11 | ||
| layout: default | ||
| tags: | ||
| - beef | ||
| - longest-common-subsequence | ||
| title: Longest Common Subsequence in Beef | ||
| --- | ||
|
|
||
| Welcome to the [Longest Common Subsequence](https://sampleprograms.io/projects/longest-common-subsequence) in [Beef](https://sampleprograms.io/languages/beef) page! Here, you'll find the source code for this program as well as a description of how the program works. | ||
|
|
||
| ## Current Solution | ||
|
|
||
| {% raw %} | ||
|
|
||
| ```beef | ||
| using System; | ||
| using System.Collections; | ||
|
|
||
| namespace LongestCommonSubsequence; | ||
|
|
||
| class Program | ||
| { | ||
| public static void Usage() | ||
| { | ||
| Console.WriteLine( | ||
| """ | ||
| Usage: please provide two lists in the format "1, 2, 3, 4, 5" | ||
| """ | ||
| ); | ||
| Environment.Exit(0); | ||
| } | ||
|
|
||
| public static Result<T> ParseInt<T>(StringView str) | ||
| where T : IParseable<T> | ||
| { | ||
| StringView trimmedStr = scope String(str); | ||
| trimmedStr.Trim(); | ||
|
|
||
| // T.Parse ignores single quotes since they are treat as digit separators -- e.g. 1'000 | ||
| if (trimmedStr.Contains('\'')) | ||
| { | ||
| return .Err; | ||
| } | ||
|
|
||
| return T.Parse(trimmedStr); | ||
| } | ||
|
|
||
| public static Result<void> ParseIntList<T>(StringView str, List<T> arr) | ||
| where T: IParseable<T> | ||
| { | ||
| arr.Clear(); | ||
| for (StringView item in str.Split(',')) | ||
| { | ||
| switch (ParseInt<T>(item)) | ||
| { | ||
| case .Ok(let val): | ||
| arr.Add(val); | ||
|
|
||
| case .Err: | ||
| return .Err; | ||
| } | ||
| } | ||
|
|
||
| return .Ok; | ||
| } | ||
|
|
||
| // Source: https://en.wikipedia.org/wiki/Longest_common_subsequence#Computing_the_length_of_the_LCS | ||
| // | ||
| // However, instead of storing lengths, an index to the subsequence is stored | ||
| public static void LongestCommonSubsequence<T>(List<T> arr1, List<T> arr2, List<T> result) | ||
| where int : operator T <=> T | ||
| { | ||
| int m = arr1.Count; | ||
| int n = arr2.Count; | ||
|
|
||
| // Initialize all subsequences to the empty sequence | ||
| int[,] c = new .[m + 1, n + 1]; | ||
| List<List<T>> subsequences = new .(); | ||
| subsequences.Add(new List<T>()); | ||
|
|
||
| // Find the longest common subsequence using prior subsequences | ||
| for (int i in 1...m) | ||
| { | ||
| for (int j in 1...n) | ||
| { | ||
| // If common element found, create new subsequence based on prior | ||
| // subsequence with the common element appended | ||
| if (arr1[i - 1] == arr2[j - 1]) | ||
| { | ||
| c[i, j] = subsequences.Count; | ||
| List<T> newSubsequence = new .() .. | ||
| AddRange(subsequences[c[i - 1, j - 1]]) .. | ||
| Add(arr1[i - 1]); | ||
| subsequences.Add(newSubsequence); | ||
| } | ||
| // Else, reuse the longer of the two prior subsequences | ||
| else | ||
| { | ||
| int index1 = c[i, j - 1]; | ||
| int index2 = c[i - 1, j]; | ||
| c[i, j] = (subsequences[index1].Count > subsequences[index2].Count) ? | ||
| index1 : index2; | ||
| } | ||
| } | ||
| } | ||
|
|
||
| // Store result | ||
| result.Clear(); | ||
| result.AddRange(subsequences[c[m, n]]); | ||
|
|
||
| // Deallocate subsequences | ||
| for (List<T> subsequence in subsequences) | ||
| { | ||
| delete subsequence; | ||
| } | ||
| delete subsequences; | ||
| delete c; | ||
| } | ||
|
|
||
| public static void ShowList<T>(List<T> arr) | ||
| { | ||
| String line = scope .(); | ||
| for (T val in arr) | ||
| { | ||
| if (!line.IsEmpty) | ||
| { | ||
| line += ", "; | ||
| } | ||
|
|
||
| line.AppendF("{}", val); | ||
| } | ||
|
|
||
| Console.WriteLine(line); | ||
| } | ||
|
|
||
| public static int Main(String[] args) | ||
| { | ||
| if (args.Count < 2) | ||
| { | ||
| Usage(); | ||
| } | ||
|
|
||
| List<int32> arr1 = scope .(); | ||
| if (ParseIntList<int32>(args[0], arr1) case .Err) | ||
| { | ||
| Usage(); | ||
| } | ||
|
|
||
| List<int32> arr2 = scope .(); | ||
| if (ParseIntList<int32>(args[1], arr2) case .Err) | ||
| { | ||
| Usage(); | ||
| } | ||
|
|
||
| List<int32> result = scope .(); | ||
| LongestCommonSubsequence<int32>(arr1, arr2, result); | ||
| ShowList<int32>(result); | ||
| return 0; | ||
| } | ||
| } | ||
|
|
||
| ``` | ||
|
|
||
| {% endraw %} | ||
|
|
||
| Longest Common Subsequence in [Beef](https://sampleprograms.io/languages/beef) was written by: | ||
|
|
||
| - rzuckerm | ||
|
|
||
| If you see anything you'd like to change or update, [please consider contributing](https://github.com/TheRenegadeCoder/sample-programs). | ||
|
|
||
| ## How to Implement the Solution | ||
|
|
||
| No 'How to Implement the Solution' section available. [Please consider contributing](https://github.com/TheRenegadeCoder/sample-programs-website). | ||
|
|
||
| ## How to Run the Solution | ||
|
|
||
| No 'How to Run the Solution' section available. [Please consider contributing](https://github.com/TheRenegadeCoder/sample-programs-website). |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters