题目一
解法
class Solution {
public String toLowerCase(String s) {
StringBuilder sb = new StringBuilder();
for(int i = 0;i题目二
解法
class Solution {
public int pivotIndex(int[] nums) {
int sum = 0;
for(int i = 0;i 题目三
解法
class Solution {
public List selfDividingNumbers(int left, int right) {
ArrayList list = new ArrayList();
for(int i = left;i<=right;i++){
if(selfDividing) list.add(i);
}
return list;
}
public boolean selfDividing(int n) {
for (char c: String.valueOf(n).toCharArray()) {
if (c == '0' || (n % (c - '0') > 0))
return false;
}
return true;
}
} 题目四
解法
class Solution {
public char nextGreatestLetter(char[] letters, char target) {
int left = 0;
int right = letters.length;
while(left 
