昨天也更新了
都是關於代碼的
不過不是框架方面
而只是特性和解題思路方面
go數組
import (
"fmt"
"sort"
"strconv"
"strings"
)
func HighAndLow(in string) string {
numStrings := strings.Fields(in)
var nums = []int{}
for _, i := range numStrings {
j, _ := strconv.Atoi(i)
nums = append(nums, j)
}
sort.Ints(nums)
return fmt.Sprintf("%d %d", nums[len(nums)-1], nums[0])
}
java數組
public static int[] deleteNth2(int[] elements, int maxOccurrences) {
Map<Integer, Integer> occurrence = new HashMap<>();
return IntStream.of(elements)
.filter(motif -> occurrence.merge(motif, 1, Integer::sum) <= maxOccurrences)
.toArray();
}