Zoka

class Solution { public int sum(int num1, int num2) { return num1+num2; } }

class Solution { public int maximumWealth(int[][] accounts) { int max=0; for(int[] i1: accounts){ int wealth...

class Solution { public int numberOfSteps(int num) { int i=0; int n=num; do{ if(n%2 == 0){ ...

/** * Definition for singly-linked list. * public class ListNode { * int val; * ListNode next; * ListNode() {} * ListNo...

class Solution { public int pivotIndex(int[] nums) { int sum, leftsum; sum = 0; leftsum = 0; for(int ...

class Solution { public List String fizzBuzz(int n) { ArrayList String al = new ArrayList (n); al.c...

class Solution { public List String fizzBuzz(int n) { ArrayList String al = new ArrayList (n); al.c...

class Solution { public boolean isIsomorphic(String s, String t) { if(s.length()!=t.length()){ return ...

class Solution { public boolean isPalindrome(int x) { if(x 0 (x % 10 == 0 x != 0)) { return false; ...

class Solution { public int[] twoSum(int[] nums, int target) { int[] result = new int[2]; for(int i = 0; i nums.len...

class Solution { public int[] runningSum(int[] nums) { for(int i=1; i nums.length; i++){ nums[i]=nums[i]+nums[i-1]; } ...

第一篇發文。