edit house robber, update README

Kevin Naughton Jr · Kevin Naughton Jr · commit 33c321593748 · 2018-04-05T16:44:06.000-04:00
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];
     }
 }

Original file line number	Diff line number	Diff line change
`@@ -20,10 +20,6 @@ public int rob(int[] nums) {`
`20`	`20`	`for(int i = 2; i < nums.length; i++) {`
`21`	`21`	`dp[i] = Math.max(dp[i - 2] + nums[i], dp[i - 1]);`
`22`	`22`	`}`
`23`		`-`
`24`		`- for(int i = 0; i < dp.length; i++) {`
`25`		`- System.out.print(dp[i] + " ");`
`26`		`- }`
`27`	`23`
`28`	`24`	`return dp[dp.length - 1];`
`29`	`25`	`}`
Original file line number	Diff line number	Diff line change
`@@ -6,7 +6,6 @@ public class HouseRobber {`
`6`	`6`	`public int rob(int[] nums) {`
`7`	`7`	`if(nums.length == 0) {`
`8`	`8`	`return 0;`
`9`		`-`
`10`	`9`	`}`
`11`	`10`
`12`	`11`	`if(nums.length == 1) {`
`@@ -22,10 +21,6 @@ public int rob(int[] nums) {`
`22`	`21`	`dp[i] = Math.max(dp[i - 2] + nums[i], dp[i - 1]);`
`23`	`22`	`}`
`24`	`23`
`25`		`- for(int i = 0; i < dp.length; i++) {`
`26`		`- System.out.print(dp[i] + " ");`
`27`		`- }`
`28`		`-`
`29`	`24`	`return dp[dp.length - 1];`
`30`	`25`	`}`
`31`	`26`	`}`
Original file line number	Diff line number	Diff line change
`@@ -21,10 +21,6 @@ public int rob(int[] nums) {`
`21`	`21`	`dp[i] = Math.max(dp[i - 2] + nums[i], dp[i - 1]);`
`22`	`22`	`}`
`23`	`23`
`24`		`- for(int i = 0; i < dp.length; i++) {`
`25`		`- System.out.print(dp[i] + " ");`
`26`		`- }`
`27`		`-`
`28`	`24`	`return dp[dp.length - 1];`
`29`	`25`	`}`
`30`	`26`	`}`