HTMLify

LeetCode - Semi-Ordered Permutation - Go
Views: 2 | Author: abh
func SliceFind(arr []int, target int) int {
	for i, v := range arr {
		if v == target {
			return i
		}
	}
	return -1
}

func semiOrderedPermutation(nums []int) int {
	n := len(nums)
	op, np := SliceFind(nums, 1), SliceFind(nums, n)
	l1 := 0
	if np < op {
		l1 = 1
	}
	return op + (n - np - 1) - l1
}

Comments