edit house robber, update README

lanhoter · May 29, 2018 · 76a22ae · 76a22ae
1 parent 4b06ffc
commit 76a22ae
Show file tree

Hide file tree

Showing 4 changed files with 4 additions and 13 deletions.
diff --git a/README.md b/README.md
@@ -8,6 +8,7 @@
 - [简体中文](./README-zh-cn.md)
 
 ## Table of Contents
+- [Instagram](#instagram)
 - [Articles](#articles)
 - [Online Judges](#online-judges)
 - [Live Coding Practice](#live-coding-practice)
@@ -21,6 +22,9 @@
 - [Computer Science News](#computer-science-news)
 - [Directory Tree](#directory-tree)
 
+## Instagram 
+* [Programeme](https://www.instagram.com/programeme/)
+
 ## Articles
 * [Starting Work](https://medium.com/@Naughton/starting-work-b06e10f6007e)
 

diff --git a/company/airbnb/HouseRobber.java b/company/airbnb/HouseRobber.java
@@ -20,10 +20,6 @@ public int rob(int[] nums) {
         for(int i = 2; i < nums.length; i++) {
             dp[i] = Math.max(dp[i - 2] + nums[i], dp[i - 1]);
         }
-
-        for(int i = 0; i < dp.length; i++) {
-            System.out.print(dp[i] + " ");
-        }
 
         return dp[dp.length - 1];
     }

diff --git a/company/linkedin/HouseRobber.java b/company/linkedin/HouseRobber.java
@@ -6,7 +6,6 @@ public class HouseRobber {
     public int rob(int[] nums) {
         if(nums.length == 0) {
             return 0;
-
         }
 
         if(nums.length == 1) {
@@ -22,10 +21,6 @@ public int rob(int[] nums) {
             dp[i] = Math.max(dp[i - 2] + nums[i], dp[i - 1]);
         }
 
-        for(int i = 0; i < dp.length; i++) {
-            System.out.print(dp[i] + " ");
-        }
-
         return dp[dp.length - 1];
     }
 }
diff --git a/leetcode/dynamic-programming/HouseRobber.java b/leetcode/dynamic-programming/HouseRobber.java
@@ -21,10 +21,6 @@ public int rob(int[] nums) {
             dp[i] = Math.max(dp[i - 2] + nums[i], dp[i - 1]);
         }
 
-        for(int i = 0; i < dp.length; i++) {
-            System.out.print(dp[i] + " ");
-        }
-
         return dp[dp.length - 1];
     }
 }