publicclassSolution{publicintrob(int[] nums){if(nums.length ==0)return0;if(nums.length ==1)return nums[0];int pre = nums[0];int cur = Math.max(nums[0], nums[1]);for(int i =2; i < nums.length; i++){int tmp = cur;
cur = Math.max(cur, pre + nums[i]);
pre = tmp;}return cur;}}