Leetcode - number of operations, non repeating numbers, diagonal traversal, Joseph Ring

Operating frequency

LeetCode： Interview questions 01.05. An editor

There are three editing operations for Strings ： Insert 、 Delete or replace .
Given two strings , And editable times k, Write a function to determine , Two strings , Whether only k Time ( Or less than k Time ) edit .

Use double pointer , and cnt Count , The same pointer advances together , Otherwise, the long character pointer advances .

test Case：

s = Solution()
res = s.oneEditAway_ad("roe", "hroose", k=3)