edit 199

Author: fishercoder1534

src/main/java/com/fishercoder/solutions/_199.java

@@ -23,24 +23,28 @@
 You should return [1, 3, 4]. */
 
 public class _199 {
-	//Using BFS is pretty straightforward. But there might be a smarter way.
+
 	public List<Integer> rightSideView(TreeNode root) {
-		List<Integer> res = new ArrayList<Integer>();
-		if(root == null) return res;
-		Queue<TreeNode> q = new LinkedList<TreeNode>();
+		List<Integer> result = new ArrayList<>();
+		if (root == null) return result;
+		Queue<TreeNode> q = new LinkedList<>();
 		q.offer(root);
-		while(!q.isEmpty()){
-			int currentSize = q.size();
-			int i = 0;
-			TreeNode currentNode = null;
-			for(; i < currentSize; i++){
-				currentNode = q.poll();
-				if(currentNode.left != null) q.offer(currentNode.left);
-				if(currentNode.right != null) q.offer(currentNode.right);
+		while (!q.isEmpty()) {
+			int size = q.size();
+			for (int i = 0; i < size; i++) {
+				TreeNode curr = q.poll();
+				if (i == size-1) {
+					result.add(curr.val);
+				}
+				if (curr.left != null) {
+					q.offer(curr.left);
+				}
+				if (curr.right != null) {
+					q.offer(curr.right);
+				}
 			}
-			res.add(currentNode.val);
 		}
-		return res;
+		return result;
 	}
 
 	public static void main(String...strings){