Given an array nums and a target, return how many times the target appears. Counting combines a linear scan with a counter. Unlike searching, it can never stop early: every element might be another match, so an unsorted array always needs one full pass. (If the array were sorted, all copies would sit together and binary searchBinary SearchRepeatedly halving a sorted range to find a value in O(log n) steps. could find their range much faster.)