add exercises

exercises/csdn/中等/打家劫舍/exercies.md

+# 打家劫舍
+
+一个小偷，计划偷窃沿街的房屋。每间房内都藏有一定的现金，影响你偷窃的唯一制约因素就是相邻的房屋装有相互连通的防盗系统，如果两间相邻的房屋在同一晚上被小偷闯入，系统会自动报警。
+
+给定一个代表每个房屋存放金额的非负整数数组，计算不触动警报装置的情况下 ，一夜之内能够偷窃到的最高金额。 
+
+## 输入描述
+输入一个正整数n代表房屋的数量(n≤100)，接着输入n个非负整数代表每间房屋的现金数量
+
+## 输出描述
+小偷能偷取的最大金额。
+
+## 输入样例
+4
+1 2 3 1
+
+## 输出样例
+4
+
+## 提示
+无

exercises/csdn/中等/打家劫舍/test_cases/1.in

+4
+1 2 3 1

exercises/csdn/中等/打家劫舍/test_cases/1.out

+4

exercises/csdn/中等/打家劫舍/test_cases/10.in

+1
+2

exercises/csdn/中等/打家劫舍/test_cases/10.out

+2

exercises/csdn/中等/打家劫舍/test_cases/2.in

+8
+1 2 3 1 4 7 2 3

exercises/csdn/中等/打家劫舍/test_cases/2.out

+14

exercises/csdn/中等/打家劫舍/test_cases/3.in

+8
+1 2 3 5 4 7 2 3

exercises/csdn/中等/打家劫舍/test_cases/3.out

+17

exercises/csdn/中等/打家劫舍/test_cases/4.in

+8
+4 2 3 5 4 7 2 3

exercises/csdn/中等/打家劫舍/test_cases/4.out

+19

exercises/csdn/中等/打家劫舍/test_cases/5.in

+8
+4 2 3 5 4 7 6 3

exercises/csdn/中等/打家劫舍/test_cases/5.out

+19

exercises/csdn/中等/打家劫舍/test_cases/6.in

+8
+4 2 3 5 4 2 6 3

exercises/csdn/中等/打家劫舍/test_cases/6.out

+17

exercises/csdn/中等/打家劫舍/test_cases/7.in

+8
+1 2 3 2 4 2 6 3

exercises/csdn/中等/打家劫舍/test_cases/7.out

+14

exercises/csdn/中等/打家劫舍/test_cases/8.in

+8
+1 2 3 2 4 2 2 3

exercises/csdn/中等/打家劫舍/test_cases/8.out

+11

exercises/csdn/中等/打家劫舍/test_cases/9.in

+8
+1 2 3 5 4 2 4 3

exercises/csdn/中等/打家劫舍/test_cases/9.out

+12