掘友等级
获得徽章 0
public boolean isFlipedString(String s1, String s2) {
}
public int getKthMagicNumber(int k) {
}
public boolean CheckPermutation(String s1, String s2) {
}
public int[] missingTwo(int[] nums) {
}
public int[] decrypt(int[] code, int k) {
}
class MyLinkedList {
public MyLinkedList() {
}
public int get(int index) {
}
public void addAtHead(int val) {
}
public void addAtTail(int val) {
}
public void addAtIndex(int index, int val) {
}
public void deleteAtIndex(int index) {
}
}
public boolean canFormArray(int[] arr, int[][] pieces) {
}
public int kSimilarity(String s1, String s2) {
}
public boolean canPartitionKSubsets(int[] nums, int k) {
}
public int[] frequencySort(int[] nums) {
}
public int largestIsland(int[][] grid) {
}
public int maxLengthBetweenEqualCharacters(String s) {
}
public int rectangleArea(int[][] rectangles) {
}
public int flipLights(int n, int presses) {
}
public double trimMean(int[] arr) {
}
public int maximumSwap(int num) {
}
public double mincostToHireWorkers(int[] quality, int[] wage, int k) {
}
public int minOperations(String[] logs) {
}
public int[] constructArray(int n, int k) {
}
