日韩性视频-久久久蜜桃-www中文字幕-在线中文字幕av-亚洲欧美一区二区三区四区-撸久久-香蕉视频一区-久久无码精品丰满人妻-国产高潮av-激情福利社-日韩av网址大全-国产精品久久999-日本五十路在线-性欧美在线-久久99精品波多结衣一区-男女午夜免费视频-黑人极品ⅴideos精品欧美棵-人人妻人人澡人人爽精品欧美一区-日韩一区在线看-欧美a级在线免费观看

歡迎訪問 生活随笔!

生活随笔

當前位置: 首頁 > 编程语言 > java >内容正文

java

leetcode 423. Reconstruct Original Digits from English | 423. 从英文中重建数字(Java)

發布時間:2024/2/28 java 35 豆豆
生活随笔 收集整理的這篇文章主要介紹了 leetcode 423. Reconstruct Original Digits from English | 423. 从英文中重建数字(Java) 小編覺得挺不錯的,現在分享給大家,幫大家做個參考.

題目

https://leetcode.com/problems/reconstruct-original-digits-from-english/

題解

class Solution {public String originalDigits(String s) {int[] total = new int[26];for (int i = 0; i < s.length(); i++) {total[s.charAt(i) - 'a']++;}int[] num = new int[10];// 0: zeroint count = total['z' - 'a'];num[0] = count;total['z' - 'a'] -= count;total['e' - 'a'] -= count;total['r' - 'a'] -= count;total['o' - 'a'] -= count;// 1:fourcount = total['u' - 'a'];num[4] = count;total['f' - 'a'] -= count;total['o' - 'a'] -= count;total['u' - 'a'] -= count;total['r' - 'a'] -= count;// 2:eightcount = total['g' - 'a'];num[8] = count;total['e' - 'a'] -= count;total['i' - 'a'] -= count;total['g' - 'a'] -= count;total['h' - 'a'] -= count;total['t' - 'a'] -= count;// 3: fivecount = total['f' - 'a'];num[5] = count;total['f' - 'a'] -= count;total['i' - 'a'] -= count;total['v' - 'a'] -= count;total['e' - 'a'] -= count;// 4: threecount = total['h' - 'a'];num[3] = count;total['t' - 'a'] -= count;total['h' - 'a'] -= count;total['r' - 'a'] -= count;total['e' - 'a'] -= count;total['e' - 'a'] -= count;// 5: twocount = total['t' - 'a'];num[2] = count;total['t' - 'a'] -= count;total['w' - 'a'] -= count;total['o' - 'a'] -= count;// 6: onecount = total['o' - 'a'];num[1] = count;total['o' - 'a'] -= count;total['n' - 'a'] -= count;total['e' - 'a'] -= count;// 7: sevencount = total['v' - 'a'];num[7] = count;total['s' - 'a'] -= count;total['e' - 'a'] -= count;total['v' - 'a'] -= count;total['e' - 'a'] -= count;total['n' - 'a'] -= count;// 8: sixcount = total['x' - 'a'];num[6] = count;total['s' - 'a'] -= count;total['i' - 'a'] -= count;total['x' - 'a'] -= count;// 9: ninecount = total['e' - 'a'];num[9] = count;total['n' - 'a'] -= count;total['i' - 'a'] -= count;total['n' - 'a'] -= count;total['e' - 'a'] -= count;StringBuilder sb = new StringBuilder();for (int i = 0; i <= 9; i++) {int r = num[i];sb.append(String.valueOf(i).repeat(Math.max(0, r)));}return sb.toString();} }

總結

以上是生活随笔為你收集整理的leetcode 423. Reconstruct Original Digits from English | 423. 从英文中重建数字(Java)的全部內容,希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網站內容還不錯,歡迎將生活随笔推薦給好友。