The deviation principles of record numbers in random walk models have not been completely investigated, especially for the non-nearest neighbor cases. In this paper, we derive the asymptotic probabilities of large and moderate deviations for the number of "weak records"(or "ladder points") in two kinds of one-dimensional non-nearest neighbor random walks. The proofs depend only on the direct analysis of random walks. We illustrate that the traditional method of analyzing the local time of Brownian motions, which is often adopted for the simple random walks, would lead to wrong conjectures for our cases.