Algorithm

[Algorithm] DP - 03. Max Subset Sum No Adjacent - Slice window

Write a function that takes in an array of positive integers and returns the maximum sum of non-adjacent elements in the array. If the input array is ......
Algorithm Adjacent Subset window Slice

[Algorithm] Dynamic programming - 02 - Longest Common Subsequence - Drawing 2d matrix + back tracing

Write a function that takes in two strings and returns their longest common subsequence. A subsequence of a string is a set of characters that aren't ......

[Algorithm] Dynamic programming - 01 - Drawing 2-d matrix

Problem: Levenshtein Distance Write a function that takes in two strings and returns the minimum number of edit operations that need to be performed o ......
programming Algorithm Dynamic Drawing matrix

[Algorithm] Disk height (DP + back tracking)

You're given a non-empty array of arrays where each subarray holds three integers and represents a disk. These integers denote each disk's width, dept ......
Algorithm tracking height Disk back

如何使用Rust迭代器, 以Luhn Algorithm的实现为例

本题来源自谷歌的Comprehensive-Rust课程第二天下午的练习 问题描述 在这个练习的描述中, Luhn Algorithm是一种用来验证银行卡号是否合法的算法. 他的具体流程如下: 去掉输入中所有的空格 得到的数字串长度如果小于0, 说明这个字符串不合法 从数字的右侧的第二个数开始, 每 ......
Algorithm Rust Luhn

Paper Reading: XRRF — An eXplainable Reasonably Randomised Forest algorithm for classification and regression problems

本文提出了一种 XRRF 算法,它通过执行本文提出的 SGFL 和 RRF 算法来得到可解释性、准确性和可解释性之间的权衡。随后引入了基于决策路径特征提取的方法,根据具体的应用解释模型的输出。其中 SGFL 能确定有助于模型准确性的特征,同时保持特征关系的可靠性。RRF 算法则通过利用所提出的改进随... ......

COMP3221 Routing Algorithm

Due: March 31st, 2023 (Friday, Week 6) by 11:59 PMCOMP3221Assignment 1: Routing AlgorithmThe goal of this assignment is to implement routing protocols ......
Algorithm Routing COMP 3221

Cryptanalyzing and Improving a Novel Color Image Encryption Algorithm Using RT-Enhanced Chaotic Tent Maps

Cryptanalyzing and Improving a Novel ColorImage Encryption Algorithm Using RT-EnhancedChaotic Tent Maps 基于RT增强混沌帐篷映射的彩色图像加密算法 文章信息 博客内容仅用于学习。 CONGXU Z ......