RATSENO

package example.leetcode; public class P70 { public int climbStairs(int n) { /* n=0 ------------->0 n=1 1 ------------->1 n=2 1,1 2 ------------->2 n=3 1,1,1 1,2 2,1 ------------->3 n=4 1,1,1,1 1,1,2 1,2,1 2,1,1 2,2 -------------->5 n=5 1,1,1,1,1 1,1,1,2 1,1,2,1 1,2,1,1 2,1,1,1 1,2,2 2,1,2 2,2,1 --------------->8 피보나치 수열 */ // base cases if(n

public class P67 { private static String addBinary(String a, String b) { StringBuilder sb = new StringBuilder(); int i = a.length() - 1; int j = b.length() -1; int carry = 0; while (i >= 0 || j >= 0) { int sum = carry; if (j >= 0){ sum += b.charAt(j--) - '0'; } if (i >= 0){ sum += a.charAt(i--) - '0'; } sb.append(sum % 2); carry = sum / 2; } if (carry != 0){ sb.append(carry); } return sb.reverse..

class Solution { public boolean isPalindrome(int x) { // Special cases: // As discussed above, when x revertedNumber) { ..