Bình luận

• 
  

  1

  Avocadorable    2:05 p.m. 7 Tháng 6, 2024

  from collections import defaultdict
  
  
  def getPalindrome(st):
  
      # Store counts of characters
      hmap = defaultdict(int)
      for i in range(len(st)):
          hmap[st[i]] += 1
  
      # Find the number of odd elements.
      # Takes O(n)
      oddCount = 0
  
      for x in hmap:
          if (hmap[x] % 2 != 0):
              oddCount += 1
              oddChar = x
  
      # odd_cnt = 1 only if the length of
      # str is odd
      if (oddCount > 1 or oddCount == 1 and
              len(st) % 2 == 0):
          return "NO SOLUTION"
  
      # Generate first half of palindrome
      firstHalf = ""
      secondHalf = ""
  
      for x in sorted(hmap.keys()):
  
          # Build a string of floor(count/2)
          # occurrences of current character
          s = (hmap[x] // 2) * x
  
          # Attach the built string to end of
          # and begin of second half
          firstHalf = firstHalf + s
          secondHalf = s + secondHalf
  
      # Insert odd character if there
      # is any
      if (oddCount == 1):
          return (firstHalf + oddChar + secondHalf)
      else:
          return (firstHalf + secondHalf)
  
  
  # Driver code
  if __name__ == "__main__":
  
      s = input()
  
      print(getPalindrome(s))
  

  1 phản hồi
• 
  

  0

  penistone    2:53 p.m. 25 Tháng 12, 2023

  Code C++
  

  #include<bits/stdc++.h>
  #define int long long
  #define endl "\n"
  using namespace std;
  
  signed main()
  {
      string s,s1=""; char c,b; int i,a[130]={},d=0,j,x;
      cin>>s;
      for(i=0;i<s.size();i++) a[s[i]]++;
      for(i=60;i<=125;i++) { if (a[i]%2!=0) d++; }
      if (d>1) { cout<<"NO SOLUTION"; return 0; }
      for(i=60;i<=125;i++)
      {
          if (a[i]%2!=0)  {b=char(i); x=i;}
          else if (a[i]%2==0&&a[i]>0) 
          {
              c=char(i); for(j=1;j<=a[i]/2;j++) s1+=c;
          }
      }
      if (d==0) 
      {
          cout<<s1; reverse(s1.begin(),s1.end()); cout<<s1; return 0;
      }
      cout<<s1; for(i=1;i<=a[x];i++) cout<<b; 
      reverse(s1.begin(),s1.end()); cout<<s1;
  }
  

• 
  

  0

  clminhquan    3:56 p.m. 4 Tháng 8, 2023

  đây là code c++ cho ae theo lời hứa đây nè

  include <bits/stdc++.h>

  using namespace std;
  void printqueue(queue<char> q)
  {
  while (!q.empty())
  {
  cout << q.front();
  q.pop();
  }
  }
  void printstack(stack<char> s)
  {
  while (!s.empty())
  {
  cout << s.top();
  s.pop();
  }
  }
  int main()
  {
  string str;
  cin >> str;
  map<char, int> c;
  stack<char> s;
  queue<char> q;
  sort(str.begin(), str.end());
  for (char i:str) c[i]++;
  int odd = 0;
  char middle = '';
  for (pair<char,int> i:c)
  {
  if (i.second %2 !=0)
  {
  if (odd)
  {
  cout << "NO SOLUTION";
  return 0;
  }
  odd ++;
  middle = i.first;
  }
  for (int j = 0; j<i.second/2; j++)
  {
  q.push(i.first);
  s.push(i.first);
  }
  }
  printqueue(q);
  if (middle!='') cout << middle;
  printstack(s);
  }

  2 phản hồi
• 
  

  0

  clminhquan    3:43 p.m. 4 Tháng 8, 2023

  ai cần code c++ tui cho

  1 phản hồi
• 
  

  0

  PhamtUan123    1:11 p.m. 12 Tháng 9, 2022 ← đã chỉnh sửa →

  tại sao ở test 1 em in ra AAAAAAAAAA lại wa vậy ạ?(đã biết lỗi sai:>)