- 博客(3)
- 资源 (1)
- 收藏
- 关注
RSS订阅原创 Activity selection Problem (DP solution 2)
#include #define MAX_ACTIVITY_NUM 100 struct activity { int start_time; int end_time; }; static struct activity g_activities[MAX_ACTIVITY_NUM]; static int g_solution[MAX_ACTIVITY_NUM][MAX_ACTIVI
2017-09-24 09:45:20
606
原创 找出被删除掉的数字
题目： 有一个整数数组（元素不重复），被删除了若干个元素。要求找出被删除的数字（按照在原数组里的位置保存）。只能通过给定的函数get()访问数组，要求访问的次数最少. #define MAX_DATA_SIZE 1000 #define MAX_DELETED_SIZE 100 enum { ORIGINAL_FILE, MODIFIED_FILE }; struct result {
2017-09-15 02:26:04
565
原创 Dynamic Programming Solution to Activity Selection Problem
#include #define MAX_ACTIVITY_NUM 100 struct activity { int start_time; int end_time; }; static struct activity g_activities[MAX_ACTIVITY_NUM]; static int g_solution[MAX_ACTIVITY_NUM][MAX_ACTIVI
2017-09-06 07:21:43
340
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人