![](https://img-blog.csdnimg.cn/20201014180756926.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
算法
The Eobs
个人博客:https://eoblog.cn/
展开
-
动态规划
0-1背包问题背包耐重c 物品重量w[],物品价值v[]建立二维数组package Test;public class Bag { public static void main(String[] args) { int[] w = {2,2,6,5,4}; int[] v = {6,3,5,4,6}; int c =10...原创 2019-10-20 15:13:51 · 171 阅读 · 0 评论 -
欧几里得算法(求最大公因数)
import java.util.Scanner;//求最大公因数public class 欧几里得算法 { public static void main(String[] args) { Scanner input= new Scanner(System.in); System.out.print("please input number to m,n\n"); int m=i...原创 2019-03-05 11:05:18 · 795 阅读 · 0 评论