Categorygithub.com/szhou12/leetcode-goleetcode2193-Minimum-Number-of-Moves-to-Make-Palindrome
package
0.0.0-20241220224003-b7cf03a90b2b
Repository: https://github.com/szhou12/leetcode-go.git
Documentation: pkg.go.dev
Overview
Dependencies
0
Dependents
0

# README

2193. Minimum Number of Moves to Make Palindrome

Solution idea

Greedy + Simulation

  1. 构想机制：有没有一个系统的方法进行转换操作？
    • 从外往内，找一个配对，“拉到”最外层，“消掉”。重复此过程，像“剥洋葱”一样。

Time complexity = $O(n^2)$

Resource